1 题目
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
Example 1:
Input: 1->2->3->3->4->4->5
Output: 1->2->5
Example 2:
Input: 1->1->1->2->3
Output: 2->3
2 尝试解
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
ListNode* dummy = new ListNode(0);
dummy->next = head;
ListNode* pre = dummy;
ListNode* cur = pre->next;
while(cur != NULL && cur->next != NULL){ //for example, 0->1->1->1->2->3
if(cur->val != cur->next->val){
pre = pre->next;
cur = cur->next;
}
else{ // cur is first 1,cur.next is second 1
while(cur->next != NULL && cur->val == cur->next->val) {//find the last 1
cur = cur->next;
}
pre->next = cur->next; //0->2->3.
cur = pre->next;
}
}
return dummy->next;
}
};
3 标准解
class Solution {
public:
ListNode *deleteDuplicates(ListNode *head) {
ListNode **runner = &head;
if(!head || !head->next)return head;
while(*runner)
{
if((*runner)->next && (*runner)->next->val == (*runner)->val)
{
ListNode *temp = *runner;
while(temp && (*runner)->val == temp->val)
temp = temp->next;
*runner = temp;
}
else
runner = &((*runner)->next);
}
return head;
}
};