Duplicates Remove from Sorted List II

    /** 82.     Remove duplicates from Sorted List II * 2016-5-13 by Mingyang * First, if it is two equal, then go down to the unequal one * this time again judge, two cases * The next 1.pre is cur. So direct two is next * 2. Then ignore the cur, because cur must be the same as before.*/     PublicListNode deleteDuplicates1 (ListNode head) {if(head==NULL)return NULL; ListNode Fakehead=NewListNode (0); Fakehead.next=Head; ListNode Pre=Fakehead; ListNode cur=Head;  while(cur!=NULL){             while(cur.next!=NULL&&cur.val==cur.next.val) {cur=Cur.next; }            if(pre.next==cur) {Pre=Pre.next; Cur=Cur.next; }            Else{Pre.next=Cur.next; Cur=Cur.next; }                }        returnFakehead.next; }

Duplicates Remove from Sorted List II