题目链接
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head==null)
{
return head;
}
ListNode workHead=new ListNode(0);
workHead.next=head;
ListNode current=head;
ListNode pre=workHead;
boolean isDelete=false;
while(current.next!=null)
{
if(current.val==current.next.val)
{
isDelete=true;
current.next=current.next.next;
}
else
if(isDelete)
{
isDelete=false;
pre.next=current.next;
current=current.next;
}
else
{
pre=current;
current=current.next;
}
}
if(isDelete)
{
pre.next=current.next;
}
return workHead.next;
}
}