题目描述
Given a sorted linked list, delete all duplicates such that each element appear only once.
Example 1:
Input: 1->1->2
Output: 1->2
Example 2:
Input: 1->1->2->3->3
Output: 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* phead = head;
while(phead != NULL) {
ListNode* cur = phead;
while(cur != NULL && cur->val == phead->val) {
cur = cur->next;
}
phead->next = cur;
phead = phead->next;
}
return head;
}
};