Skip to content

Commit f154324

Browse files
authored
feat: add typescript solution to lc problem: No.0203.Remove Linked List Elements (#437)
1 parent 16ec521 commit f154324

File tree

3 files changed

+82
-0
lines changed

3 files changed

+82
-0
lines changed

solution/0200-0299/0203.Remove Linked List Elements/README.md

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -136,6 +136,35 @@ func removeElements(head *ListNode, val int) *ListNode {
136136
}
137137
```
138138

139+
### **TypeScript**
140+
141+
```ts
142+
/**
143+
* Definition for singly-linked list.
144+
* class ListNode {
145+
* val: number
146+
* next: ListNode | null
147+
* constructor(val?: number, next?: ListNode | null) {
148+
* this.val = (val===undefined ? 0 : val)
149+
* this.next = (next===undefined ? null : next)
150+
* }
151+
* }
152+
*/
153+
154+
function removeElements(head: ListNode | null, val: number): ListNode | null {
155+
let dummy: ListNode = new ListNode(0, head);
156+
let cur: ListNode = dummy;
157+
while (cur.next != null) {
158+
if (cur.next.val == val) {
159+
cur.next = cur.next.next;
160+
} else {
161+
cur = cur.next;
162+
}
163+
}
164+
return dummy.next;
165+
};
166+
```
167+
139168
### **...**
140169

141170
```

solution/0200-0299/0203.Remove Linked List Elements/README_EN.md

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -127,6 +127,35 @@ func removeElements(head *ListNode, val int) *ListNode {
127127
}
128128
```
129129

130+
### **TypeScript**
131+
132+
```ts
133+
/**
134+
* Definition for singly-linked list.
135+
* class ListNode {
136+
* val: number
137+
* next: ListNode | null
138+
* constructor(val?: number, next?: ListNode | null) {
139+
* this.val = (val===undefined ? 0 : val)
140+
* this.next = (next===undefined ? null : next)
141+
* }
142+
* }
143+
*/
144+
145+
function removeElements(head: ListNode | null, val: number): ListNode | null {
146+
let dummy: ListNode = new ListNode(0, head);
147+
let cur: ListNode = dummy;
148+
while (cur.next != null) {
149+
if (cur.next.val == val) {
150+
cur.next = cur.next.next;
151+
} else {
152+
cur = cur.next;
153+
}
154+
}
155+
return dummy.next;
156+
};
157+
```
158+
130159
### **...**
131160

132161
```
Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
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 removeElements(head: ListNode | null, val: number): ListNode | null {
14+
let dummy: ListNode = new ListNode(0, head);
15+
let cur: ListNode = dummy;
16+
while (cur.next != null) {
17+
if (cur.next.val == val) {
18+
cur.next = cur.next.next;
19+
} else {
20+
cur = cur.next;
21+
}
22+
}
23+
return dummy.next;
24+
};

0 commit comments

Comments
 (0)