[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.

/**
 * 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) return head;
        ListNode *p=head;
        while(p->next)
        {
            if(p->val == p->next->val) p->next=p->next->next;
            else p=p->next;
        }
        return head;
    }
};

注意：

当两个元素相等时，p不用往后移，继续比较；

当元素不等时，p往后移