问题描述:
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.
代码如下:4ms
struct ListNode* deleteDuplicates(struct ListNode* head) {
if(!head)
return head;
struct ListNode *prev = head;
struct ListNode *current = head->next;
while(current){
if(prev->val==current->val)
prev->next = current->next;
else
prev = current;
current = current->next;
}
return head;
}