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
.
一次通过,自认为方法还是比较简洁的,关于头的定义与处理,从以前的题目中学到了比较好的处理方法:
/**
* 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 newhead(0);
ListNode *prev = &newhead;
while(head)
{
prev->next = head;
if(head->next && head->val==head->next->val)
head = head->next;
else
{
prev = head;
head = head->next;
}
}
return newhead.next;
}
};