/**
* 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 pre = new ListNode(0);
pre.next = head;
ListNode a = pre;
ListNode b = head;
while(b!=null&&b.next!=null){
if(a.next.val!=b.next.val){
a = a.next;
b = b.next;
}else{
while(b!=null&&b.next!=null&&b.val==b.next.val) b = b.next;
a.next = b.next;
b = b.next;
}
}
return pre.next;
}
}
做指针还是得理清楚一些