[Leetcode]#83 Remove Duplicates from Sorted List

Given a sorted linked list, delete all duplicates such that each element appear only once.

For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.

//#83 Remove Duplicates from Sorted List
//16ms 80.77%
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) 
    {
        if(head == NULL) return head;
        while(head->next != NULL && head->next->val == head->val)
        {
            head = head->next;
        }       
        ListNode *p(head);
        while(p->next != NULL && p->next->next != NULL)
        {
            if(p->next->val == p->next->next->val)
            {
                p->next = p->next->next;
            }
            else
            {
                p = p->next;
            }
        }
        return head;            
    }
};