LeetCode-E-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.

Subscribe to see which companies asked this question.

解法

保留一个pre指针，一个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 || head->next == NULL) return head;
        ListNode* pre = head;
        ListNode* cur = head->next;
        while(cur != NULL){
            if(cur->val == pre->val){
                pre->next = cur->next;
                cur->next = NULL;
                cur = pre->next;
            }else{
                pre = cur;
                cur = cur->next;
            }
        }
        return head;
    }
};