-
Notifications
You must be signed in to change notification settings - Fork 21
/
RemoveDuplicatesFromSortedListII.js
119 lines (106 loc) 路 2.89 KB
/
RemoveDuplicatesFromSortedListII.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
/**
* Given a sorted linked list, delete all nodes that have duplicate numbers,
* leaving only distinct numbers from the original list.
*
* For example,
* Given 1->2->3->3->4->4->5, return 1->2->5.
* Given 1->1->1->2->3, return 2->3.
*
* Accepted.
*/
function ListNode(val) {
this.val = val;
this.next = null;
this.equals = function (node) {
return this.next == null && node.next == null || this.val === node.val && (this.next != null) && this.next.equals(node.next);
}
}
/**
* @param {ListNode} head
* @return {ListNode}
*/
let deleteDuplicates = function (head) {
if (head == null) {
return null;
}
let fakeHead = new ListNode(0);
fakeHead.next = head;
let node = fakeHead;
while (node.next != null) {
let tmp = node.next;
if (tmp.next != null && tmp.val === tmp.next.val) {
while (tmp.next != null && tmp.val === tmp.next.val)
tmp = tmp.next;
node.next = tmp.next;
tmp.next = null;
} else {
node = node.next;
}
}
return fakeHead.next;
};
let node1233445 = new ListNode(1);
node1233445.next = new ListNode(2);
node1233445.next.next = new ListNode(3);
node1233445.next.next.next = new ListNode(3);
node1233445.next.next.next.next = new ListNode(4);
node1233445.next.next.next.next.next = new ListNode(4);
node1233445.next.next.next.next.next.next = new ListNode(5);
let tmp = new ListNode(1);
tmp.next = new ListNode(2);
tmp.next.next = new ListNode(5);
if (deleteDuplicates(node1233445).equals(tmp)) {
console.log("pass")
} else {
console.error("failed")
}
let node11123 = new ListNode(1);
node11123.next = new ListNode(1);
node11123.next.next = new ListNode(1);
node11123.next.next.next = new ListNode(2);
node11123.next.next.next.next = new ListNode(3);
tmp = new ListNode(2);
tmp.next = new ListNode(3);
if (deleteDuplicates(node11123).equals(tmp)) {
console.log("pass")
} else {
console.error("failed")
}
let node111 = new ListNode(1);
node111.next = new ListNode(1);
node111.next.next = new ListNode(1);
if (deleteDuplicates(node111) == null) {
console.log("pass")
} else {
console.error("failed")
}
if (deleteDuplicates(null) == null) {
console.log("pass")
} else {
console.error("failed")
}
let node122 = new ListNode(1);
node122.next = new ListNode(2);
node122.next.next = new ListNode(2);
tmp = new ListNode(1);
if (deleteDuplicates(node122).equals(tmp)) {
console.log("pass")
} else {
console.error("failed")
}
let node11 = new ListNode(1);
node11.next = new ListNode(1);
if (deleteDuplicates(node11) == null) {
console.log("pass")
} else {
console.error("failed")
}
let node1122 = new ListNode(1);
node1122.next = new ListNode(1);
node1122.next.next = new ListNode(2);
node1122.next.next.next = new ListNode(2);
if (deleteDuplicates(node1122) == null) {
console.log("pass")
} else {
console.error("failed")
}