首页 > 其他 > 详细

Leetcode41: Remove Duplicates from Sorted List

时间:2015-06-29 20:26:39      阅读:228      评论:0      收藏:0      [点我收藏+]

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)    return NULL;
        ListNode *cur = head;
        ListNode *next = head->next;
        while(next != NULL)
        {
            if(next->val == cur->val)
            {
                cur->next = next->next;
                delete next;
                next = cur->next;
            }
            else
            {
                cur = cur->next;
                next = next->next;
            }
        }
        return head;
    }
};
技术分享

版权声明:本文为博主原创文章,未经博主允许不得转载。

Leetcode41: Remove Duplicates from Sorted List

原文:http://blog.csdn.net/u013089961/article/details/46684543

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!