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
.
分析:从头开始比较前后两个的值,相同便删除后一个
class Solution {
public:
ListNode *deleteDuplicates(ListNode *head) {
if(head == NULL)return NULL;
ListNode *cur = head;
while(cur->next)
{
if(cur->val == cur->next->val)
{
ListNode *temp = cur->next;
cur->next = cur->next->next;
delete temp;
}
else cur = cur->next;
}
return head;
}
};