【LeetCode】83

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.

Solution:

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