Skip to content

Commit 3a21c93

Browse files
committed
solved: 82
1 parent c759abd commit 3a21c93

File tree

1 file changed

+43
-0
lines changed

1 file changed

+43
-0
lines changed
Lines changed: 43 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
class ListNode {
2+
val: number
3+
next: ListNode | null
4+
constructor(val?: number, next?: ListNode | null) {
5+
this.val = (val===undefined ? 0 : val)
6+
this.next = (next===undefined ? null : next)
7+
}
8+
}
9+
10+
// @leet start
11+
/**
12+
* Definition for singly-linked list.
13+
* class ListNode {
14+
* val: number
15+
* next: ListNode | null
16+
* constructor(val?: number, next?: ListNode | null) {
17+
* this.val = (val===undefined ? 0 : val)
18+
* this.next = (next===undefined ? null : next)
19+
* }
20+
* }
21+
*/
22+
23+
function deleteDuplicates(head: ListNode | null): ListNode | null {
24+
const nm = new Map<number, number>( )
25+
while (head) {
26+
nm.set(head.val, (nm.get(head.val) ?? 0) + 1)
27+
head = head.next
28+
}
29+
30+
/** get numbers which appears only once */
31+
const arr = Array.from(nm.entries()).filter(([_, v]) => v === 1).map(([k, _]) => k).sort((a, b) => a - b)
32+
33+
/** create a new list */
34+
const dummy = new ListNode()
35+
let current = dummy
36+
arr.forEach((v) => {
37+
current.next = new ListNode(v)
38+
current = current.next
39+
})
40+
41+
return dummy.next
42+
};
43+
// @leet end

0 commit comments

Comments
 (0)