问题:
思路:
引入一个头节点,让其next指向head
1 | 2 | 3 | 3 | 4 | 4 | 5 | |
1,2 | |||||||
1 | 2 | ||||||
1 | 2 | ||||||
1 | 2(删) | ||||||
1 | 2 | ||||||
也要考虑,最后一个数字需要删除的情况, right.next 为空
代码:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode ln = new ListNode(-111);
ln.next = head;
ListNode left = ln;
ListNode right = ln;
if (head == null || right.next.next == null) {
return head;
}
right = right.next;
while (right.next != null) {
if (left.next.val == right.next.val) {
while (right.next != null && left.next.val == right.next.val) {
right = right.next;
}
if (right.next == null) {
left.next = null;
break;
}
right = right.next;
left.next = right;
} else {
left = left.next;
right = right.next;
}
}
return ln.next;
}
}