首页 > 其他 > 详细

[LeetCode]Remove Duplicates from Sorted List

时间:2015-10-23 00:00:25      阅读:224      评论: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.

解题思路:

 1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     ListNode *next;
 6  *     ListNode(int x) : val(x), next(NULL) {}
 7  * };
 8  */
 9 class Solution {
10 public:
11     ListNode* deleteDuplicates(ListNode* head) {
12         ListNode *prev = NULL;
13         for (ListNode *cur = head; cur != NULL; cur = cur->next) {
14             if (cur == head) {
15                 prev = cur;
16                 continue;
17             }
18             
19             if (cur->val == prev->val) {
20                 prev->next = cur->next;
21             } else {
22                 prev = cur;
23             }
24         }
25         
26         return head;
27     }
28 };

 

[LeetCode]Remove Duplicates from Sorted List

原文:http://www.cnblogs.com/skycore/p/4903146.html

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