forked from Wang-Jun-Chao/coding-interviews
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTest57.java
267 lines (229 loc) · 6.63 KB
/
Test57.java
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
/**
* Author: 王俊超
* Date: 2015-06-16
* Time: 09:18
* Declaration: All Rights Reserved !!!
*/
public class Test57 {
private static class ListNode {
private int val;
private ListNode next;
public ListNode() {
}
public ListNode(int val) {
this.val = val;
}
@Override
public String toString() {
return val + "";
}
}
private static ListNode deleteDuplication(ListNode head) {
// 为null
if (head == null) {
return null;
}
// // 只有一个结点
// if (head.next == null) {
// return head;
// }
// 临时的头结点
ListNode root = new ListNode();
root.next = head;
// 记录前驱结点
ListNode prev = root;
// 记录当前处理的结点
ListNode node = head;
while (node != null && node.next != null) {
// 有重复结点,与node值相同的结点都要删除
if (node.val == node.next.val) {
// 找到下一个不同值的节点,注意其有可能也是重复节点
while (node.next != null && node.next.val == node.val) {
node = node.next;
}
// 指向下一个节点,prev.next也可能是重复结点
// 所以prev不要移动到下一个结点
prev.next = node.next;
}
// 相邻两个值不同,说明node不可删除,要保留
else {
prev.next = node;
prev = prev.next;
}
node = node.next;
}
return root.next;
}
private static void print(ListNode head) {
while (head != null) {
System.out.print(head + "->");
head = head.next;
}
System.out.println("null");
}
public static void main(String[] args) {
test01();
test02();
test03();
test04();
test05();
test06();
test07();
test08();
test09();
test10();
}
// 1->2->3->3->4->4->5
private static void test01() {
ListNode n1 = new ListNode(1);
ListNode n2 = new ListNode(2);
ListNode n3 = new ListNode(3);
ListNode n4 = new ListNode(3);
ListNode n5 = new ListNode(4);
ListNode n6 = new ListNode(4);
ListNode n7 = new ListNode(5);
n1.next = n2;
n2.next = n3;
n3.next = n4;
n4.next = n5;
n5.next = n6;
n6.next = n7;
ListNode result = deleteDuplication(n1);
print(result);
}
// 1->2->3->4->5->6->7
private static void test02() {
ListNode n1 = new ListNode(1);
ListNode n2 = new ListNode(2);
ListNode n3 = new ListNode(3);
ListNode n4 = new ListNode(4);
ListNode n5 = new ListNode(5);
ListNode n6 = new ListNode(6);
ListNode n7 = new ListNode(7);
n1.next = n2;
n2.next = n3;
n3.next = n4;
n4.next = n5;
n5.next = n6;
n6.next = n7;
ListNode result = deleteDuplication(n1);
print(result);
}
// 1->1->1->1->1->1->2
private static void test03() {
ListNode n1 = new ListNode(1);
ListNode n2 = new ListNode(1);
ListNode n3 = new ListNode(1);
ListNode n4 = new ListNode(1);
ListNode n5 = new ListNode(1);
ListNode n6 = new ListNode(1);
ListNode n7 = new ListNode(2);
n1.next = n2;
n2.next = n3;
n3.next = n4;
n4.next = n5;
n5.next = n6;
n6.next = n7;
ListNode result = deleteDuplication(n1);
print(result);
}
// 1->1->1->1->1->1->1
private static void test04() {
ListNode n1 = new ListNode(1);
ListNode n2 = new ListNode(1);
ListNode n3 = new ListNode(1);
ListNode n4 = new ListNode(1);
ListNode n5 = new ListNode(1);
ListNode n6 = new ListNode(1);
ListNode n7 = new ListNode(1);
n1.next = n2;
n2.next = n3;
n3.next = n4;
n4.next = n5;
n5.next = n6;
n6.next = n7;
ListNode result = deleteDuplication(n1);
print(result);
}
// 1->1->2->2->3->3->4->4
private static void test05() {
ListNode n1 = new ListNode(1);
ListNode n2 = new ListNode(1);
ListNode n3 = new ListNode(2);
ListNode n4 = new ListNode(2);
ListNode n5 = new ListNode(3);
ListNode n6 = new ListNode(3);
ListNode n7 = new ListNode(4);
ListNode n8 = new ListNode(4);
n1.next = n2;
n2.next = n3;
n3.next = n4;
n4.next = n5;
n5.next = n6;
n6.next = n7;
n7.next = n8;
ListNode result = deleteDuplication(n1);
print(result);
}
// 1->1->2->3->3->4->5->5
private static void test06() {
ListNode n1 = new ListNode(1);
ListNode n2 = new ListNode(1);
ListNode n3 = new ListNode(2);
ListNode n4 = new ListNode(3);
ListNode n5 = new ListNode(3);
ListNode n6 = new ListNode(4);
ListNode n7 = new ListNode(5);
ListNode n8 = new ListNode(5);
n1.next = n2;
n2.next = n3;
n3.next = n4;
n4.next = n5;
n5.next = n6;
n6.next = n7;
n7.next = n8;
ListNode result = deleteDuplication(n1);
print(result);
}
// 1->1->2->2->3->3->4->5->5
private static void test07() {
ListNode n1 = new ListNode(1);
ListNode n2 = new ListNode(1);
ListNode n3 = new ListNode(2);
ListNode n4 = new ListNode(2);
ListNode n5 = new ListNode(3);
ListNode n6 = new ListNode(3);
ListNode n7 = new ListNode(4);
ListNode n8 = new ListNode(5);
ListNode n9 = new ListNode(5);
n1.next = n2;
n2.next = n3;
n3.next = n4;
n4.next = n5;
n5.next = n6;
n6.next = n7;
n7.next = n8;
n8.next = n9;
ListNode result = deleteDuplication(n1);
print(result);
}
// 1->2
private static void test08() {
ListNode n1 = new ListNode(1);
ListNode n2 = new ListNode(2);
n1.next = n2;
ListNode result = deleteDuplication(n1);
print(result);
}
// 1
private static void test09() {
ListNode n1 = new ListNode(1);
ListNode result = deleteDuplication(n1);
print(result);
}
// null
private static void test10() {
ListNode result = deleteDuplication(null);
print(result);
}
}