-
Notifications
You must be signed in to change notification settings - Fork 150
/
DeleteDuplication57.java
48 lines (44 loc) · 1.17 KB
/
DeleteDuplication57.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
package com.so;
/**
* 第57题
* 删除链表的重复节点
*
* @author qgl
* @date 2017/08/30
*/
public class DeleteDuplication57 {
static class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}
public static ListNode deleteDuplication(ListNode pHead) {
if (pHead == null) {
return null;
}
// 新建一个节点,防止头结点被删除
ListNode dummy = new ListNode(-1);
dummy.next = pHead;
ListNode p = pHead;
// 指向前一个节点
ListNode preNode = dummy;
while (p != null && p.next != null) {
if (p.val == p.next.val) {
int val = p.val;
// 向后重复查找
while (p != null && p.val == val) {
p = p.next;
}
// 赋值:相当于删除
preNode.next = p;
}else {
// 如果当前节点和下一个节点值不等,则向后移动一位
preNode = p;
p = p.next;
}
}
return dummy.next;
}
}