【LeetCode】83. Remove Duplicates from Sorted List

LeetCode-83

Links:https://leetcode.com/problems/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 || head->next==NULL)return head;
        ListNode* temp = head;
        int v = temp->val;
        while(temp->next!=NULL)
        {
            if(temp->next->val > v)
            {
                temp = temp->next;
                v = temp->val;
            }
            else if(temp->next->val == v)
            {
                temp->next = temp->next->next;
            }
        }
        return head;
    }
};

/**

* 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* temp = head;

int v = temp->val;

while(temp->next!=NULL)

{

if(temp->next->val > v)

{

temp = temp->next;

v = temp->val;

}

else if(temp->next->val == v)

{

temp->next = temp->next->next;

}

return head;

}

};

【LeetCode】83. Remove Duplicates from Sorted List

Tagged on: LeetCode