解题思路
这道题用画图的方式是比较好理解的。。
相关代码
/**
* 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 H = new ListNode(-200);
H.next = head;
ListNode p1 = H;
ListNode p2 = head;
while(p2!=null){
if(p2.val==p1.val){
p2=p2.next;
}
else{
p1.next=p2;
p1=p1.next;
p2=p2.next;
}
}
p1.next=null;
return H.next;
}
}