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