LeetCode 83. Remove Duplicates from Sorted List

来源:互联网 发布:r语言编程艺术 pdf 编辑:程序博客网 时间:2024/03/29 04:55

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

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


0 0