地址：http://oj.leetcode.com/problems/remove-duplicates-from-sorted-list-ii/
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.
参考代码：
/**
* 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)
{
ListNode* p1 = head, *p2 = head->next;
if(p2 && p2->val == p1->val)
{
while(p2 && p2->val == p1->val)
{
while(p2 && p2->val == p1->val)
p2 = p2->next;
p1 = head = p2;
if(p1)
p2 = p1 ->next;
}
}
while(p2)
{
if(p2->next && p2->val == p2->next->val)
{
while(p2->next && p2->val == p2->next->val)
{
p2 = p2->next;
}
p1->next = p2->next;
if(p1)
p2 = p1->next;
else
break;
}
else
{
p2 = p2->next;
p1 = p1->next;
}
}
}
return head;
}
};
//SECOND TRIALclass Solution {public :ListNode * deleteDuplicates ( ListNode * head ) {if ( ! head )return head ;ListNode * pre = head , * mid = head , * cur = head -> next ;while ( cur ){if ( cur -> val != mid -> val ){pre = mid ;mid = cur ;cur = cur -> next ;}else{if ( pre == mid ){while ( cur && cur -> val == mid -> val )cur = cur -> next ;if ( cur ){head = pre = mid = cur ;cur = cur -> next ;}elsereturn NULL ;}else{while ( cur && cur -> val == mid -> val )cur = cur -> next ;if ( cur ){mid = cur ;pre -> next = mid ;cur = cur -> next ;}elsepre -> next = NULL ;}}}return head ;}};
扫一扫
210
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
