Lintcode 112. Delete a repeating element in a sorted list

Given a sorted list, delete all duplicate elements, leaving only one for each element. Sample Example

Give 1->1->2->null , return1->2->null

Give 1->1->2->3->3->null , return1->2->3->null

/** Definition of ListNode * class ListNode {* Public: * int val; * ListNode *next; * ListNode (int val) { * This->val = val; * This->next = NULL; *     } * } */classSolution { Public:    /** @param Head:head is the head of the linked list * @return: Head of linked list*/ListNode* Deleteduplicates (ListNode *head) {        //Write your code here        if(head==NULL)return 0; ListNode*p=Head; ListNode*Next;  while(p->next!=NULL) {Next=p->Next; if(next->val==p->val) {P->next=next->Next; Delete(next); }Else//else is important .{p=p->Next; }                    }        returnHead; }};

Lintcode 112. Delete a repeating element in a sorted list