LeetCode Everyday -- 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) {

        ListNode* node = head;
        if(node == NULL || node->next == NULL)
            return head;
        while(node->next != NULL){
                while(node->val == node->next->val){
                    ListNode* n = node->next;
                    node->next = n->next;
                    delete n;
                    if(node->next == NULL){
                        return head;
                }
            }
            node = node->next;
        }
       return head;
    }
};

思路：
遍历链表，如果前后两个数相同，保留前一个数，指针向后指，寻找下一个数，直到找到不同的数。