题目:
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
For example,
Given 1->2->3->3->4->4->5, return 1->2->5.
Given 1->1->1->2->3, return 2->3.
分析:将val值重复的node,完全去掉。
思路1:根Remove Duplicates from Sorted List思路一样,只是在这里,需要全部去掉。因此需要向前判断。
代码1:
/**
* 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) return head;
ListNode* pre = new ListNode(0);
ListNode* h = pre;
ListNode* now;
ListNode* next;
now = head;
while(now)
{
next = now->next;
if(next && now->val == next->val)
{
while(next && now->val == next->val)
{
next = next->next;
}
pre->next = next;
now = next;
}
else
{
pre->next = now;
pre = pre->next;
now = next;
}
}
return h->next;
}
};
【其他思路】:
采用递归的方式,每次将满足条件的node留下,将剩下的作为新的链表,调用函数来判断。
代码:【引自:https://leetcode.com/discuss/33666/simple-and-clear-c-recursive-solution】
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if (!head) return 0;
if (!head->next) return head;
int val = head->val;
ListNode* p = head->next;
if (p->val != val) {
head->next = deleteDuplicates(p);
return head;
} else {
while (p && p->val == val) p = p->next;
return deleteDuplicates(p);
}
}
};