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.

这个问题思路简单；

code：

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