Leetcode (83)-delete repeating elements in a sorted list

Given a sorted list, delete all duplicate elements so that each element appears only once.

Example 1:

Input: 1->1->2 output: 1->2

Example 2:

Input: 1->1->2->3->3 output: 1->2->3

Idea: To delete a sorted list of repeating elements, repeating elements are next to each other, or with two pointers to solve the problem, a pointer to find duplicate elements, a pointer to re-concatenate a new linked list.

listnode* deleteduplicates (listnode* head)     {        ifreturn  head;        ListNode* cur,*p;        Cur=p=head;          while (cur)        {            if(p->val!=cur->val)            {                P->next=cur;                P=cur;            }            Cur=cur->next;        }        P->next=NULL;         return head;    }

Leetcode (83)-delete duplicate elements in the sorted list