码迷,mamicode.com
首页 > 其他好文 > 详细

83. Remove Duplicates from Sorted List

时间:2017-09-26 21:17:45      阅读:118      评论:0      收藏:0      [点我收藏+]

标签:link   appear   nod   remove   log   等于   bsp   nullptr   lan   

83. 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.

思路:只要相等就不断head -> next等于下一个元素。直到不相等为止。

/**
 * 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 == nullptr){
            return nullptr;
        }
        ListNode* dummyNode = new ListNode(-1);
        dummyNode -> next  = head;
        head = dummyNode;
        
        while(head -> next != nullptr && head -> next -> next != nullptr){
            if(head -> next -> val == head -> next -> next -> val){                              
                head -> next = head -> next -> next;                   
            }                
            else{
               head = head -> next; 
            }
                       
        }
        return dummyNode -> next;
    }
};

 

83. Remove Duplicates from Sorted List

标签:link   appear   nod   remove   log   等于   bsp   nullptr   lan   

原文地址:http://www.cnblogs.com/dingxiaoqiang/p/7598600.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!