Skip to content

Commit 0734b1c

Browse files
committed
feat: add solutions to lc problem: No.1171
No.1171. Remove Zero Sum Consecutive Nodes from Linked List
1 parent 1297476 commit 0734b1c

File tree

3 files changed

+91
-0
lines changed

3 files changed

+91
-0
lines changed

solution/1100-1199/1171.Remove Zero Sum Consecutive Nodes from Linked List/README.md

Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -195,6 +195,38 @@ func removeZeroSumSublists(head *ListNode) *ListNode {
195195
}
196196
```
197197

198+
### **TypeScript**
199+
200+
```ts
201+
/**
202+
* Definition for singly-linked list.
203+
* class ListNode {
204+
* val: number
205+
* next: ListNode | null
206+
* constructor(val?: number, next?: ListNode | null) {
207+
* this.val = (val===undefined ? 0 : val)
208+
* this.next = (next===undefined ? null : next)
209+
* }
210+
* }
211+
*/
212+
213+
function removeZeroSumSublists(head: ListNode | null): ListNode | null {
214+
const dummy = new ListNode(0, head);
215+
const last = new Map<number, ListNode>();
216+
let s = 0;
217+
for (let cur = dummy; cur; cur = cur.next) {
218+
s += cur.val;
219+
last.set(s, cur);
220+
}
221+
s = 0;
222+
for (let cur = dummy; cur; cur = cur.next) {
223+
s += cur.val;
224+
cur.next = last.get(s)!.next;
225+
}
226+
return dummy.next;
227+
}
228+
```
229+
198230
### **...**
199231

200232
```

solution/1100-1199/1171.Remove Zero Sum Consecutive Nodes from Linked List/README_EN.md

Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -174,6 +174,38 @@ func removeZeroSumSublists(head *ListNode) *ListNode {
174174
}
175175
```
176176

177+
### **TypeScript**
178+
179+
```ts
180+
/**
181+
* Definition for singly-linked list.
182+
* class ListNode {
183+
* val: number
184+
* next: ListNode | null
185+
* constructor(val?: number, next?: ListNode | null) {
186+
* this.val = (val===undefined ? 0 : val)
187+
* this.next = (next===undefined ? null : next)
188+
* }
189+
* }
190+
*/
191+
192+
function removeZeroSumSublists(head: ListNode | null): ListNode | null {
193+
const dummy = new ListNode(0, head);
194+
const last = new Map<number, ListNode>();
195+
let s = 0;
196+
for (let cur = dummy; cur; cur = cur.next) {
197+
s += cur.val;
198+
last.set(s, cur);
199+
}
200+
s = 0;
201+
for (let cur = dummy; cur; cur = cur.next) {
202+
s += cur.val;
203+
cur.next = last.get(s)!.next;
204+
}
205+
return dummy.next;
206+
}
207+
```
208+
177209
### **...**
178210

179211
```
Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
/**
2+
* Definition for singly-linked list.
3+
* class ListNode {
4+
* val: number
5+
* next: ListNode | null
6+
* constructor(val?: number, next?: ListNode | null) {
7+
* this.val = (val===undefined ? 0 : val)
8+
* this.next = (next===undefined ? null : next)
9+
* }
10+
* }
11+
*/
12+
13+
function removeZeroSumSublists(head: ListNode | null): ListNode | null {
14+
const dummy = new ListNode(0, head);
15+
const last = new Map<number, ListNode>();
16+
let s = 0;
17+
for (let cur = dummy; cur; cur = cur.next) {
18+
s += cur.val;
19+
last.set(s, cur);
20+
}
21+
s = 0;
22+
for (let cur = dummy; cur; cur = cur.next) {
23+
s += cur.val;
24+
cur.next = last.get(s)!.next;
25+
}
26+
return dummy.next;
27+
}

0 commit comments

Comments
 (0)