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.

 

有序链表去重

 

C++（13ms）：

 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* temp = head ;
13         while(temp){
14             while(temp->next && temp->val == temp->next->val)
15                 temp->next = temp->next->next ;
16             temp = temp->next ;
17         }
18         return head ;
19     }
20 };

 

posted @ 2017-12-31 13:37  __Meng  阅读(135)  评论(0)  编辑  收藏  举报