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

[LeetCode] Remove Duplicates from Sorted List

时间:2014-06-21 07:30:11      阅读:157      评论:0      收藏:0      [点我收藏+]

标签:style   class   blog   code   ext   color   

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) {
        
        ListNode *p = NULL,*q;
        
        if(head == NULL || head->next == NULL)
            return head;
            
        p = head;
        
        while(p!=NULL && p->next !=NULL){
            if(p->next->val == p->val){
                q = p->next->next;
                //Delete p->next;    //不需要的指针不删除吗?提示‘Delete‘ was not declared in this scope                p->next = q;
            }else{
                p = p->next;
            }//end if   
        }//end while
        return head;
    }
};

 

[LeetCode] Remove Duplicates from Sorted List,布布扣,bubuko.com

[LeetCode] Remove Duplicates from Sorted List

标签:style   class   blog   code   ext   color   

原文地址:http://www.cnblogs.com/Xylophone/p/3795366.html

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