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
.
和26题很像,只是是链表,要记得更新循环变量,cur
代码如下:
/**
* 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) {
if (head == NULL || head->next == NULL) return head;
ListNode *end = head;
ListNode *cur = head->next;
while (cur != NULL) {
if (end->val != cur->val) {
end = end->next;
end->val = cur->val;
}
cur = cur->next;
}
end->next = NULL;
return head;
}
};