Remove Duplicates from Sorted List -- leetcode

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

Remove Duplicates from Sorted List -- leetcode

原文：http://blog.csdn.net/elton_xiao/article/details/45113887