LeetCode: Remove Duplicates from Sorted List [082]

【题目】

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.

【题意】

给定一个已排序的链表，删除其中的重复元素

【思路】

维护两个指针prev和cur, cur指针负责扫描链表，prev指向cur的前一个节点

【代码】

/**
 * 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;
        if(head->next==NULL)return head;

        ListNode*prev=head;
        ListNode*cur=head->next;
        while(cur){
            if(cur->val==prev->val){
                prev->next=cur->next;
                cur=prev->next;
            }
            else{
                prev=cur;
                cur=cur->next;
            }
        }
        return head;
    }
};

LeetCode: Remove Duplicates from Sorted List [082]