Description:
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) {
ListNode* curr = head;
if(head == NULL)
return NULL;
while(curr->next != NULL){
if(curr->val == curr->next->val){
curr->next = curr->next->next;
}
else{
curr = curr->next;
}
}
return head;
}
};