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
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31 |
/** * 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||head->next == NULL)return
head; ListNode *pre = head, *temp = head->next; while(temp!=NULL) { if(temp->val == pre->val) { pre->next =temp->next; temp = temp->next; } else { pre =temp; temp =temp->next; } } return
head; }}; |
Remove Duplicates from Sorted List,布布扣,bubuko.com
Remove Duplicates from Sorted List
原文：http://www.cnblogs.com/pengyu2003/p/3650142.html