问题:
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
.
这其实是个比较经典的问题了,删除链表中的重复元素。从头指针开始,判断下一个是否相同,如果相同就next=next的next,跳过他。如果不同,指针后移。最后返回头指针。上代码:
/**
* 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* cur = head;
while(cur) {
while(cur->next && cur->val == cur->next->val) {
cur->next = cur->next->next;
}
cur = cur->next;
}
return head;
}
};