题目链接这里
/**
* 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 null;
}
int preValue=head.val;
ListNode pre=head;
ListNode current=head.next;
while(current!=null)
{
if(current.val==preValue)
{
pre.next=current.next;
}
else
{
pre=current;
preValue=current.val;
}
current=current.next;
}
pre.next=null;
return head;
}
}