首页 > 代码库 > 82. Remove Duplicates from Sorted List II
82. 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.
1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int val; 5 * ListNode *next; 6 * ListNode(int x) : val(x), next(NULL) {} 7 * }; 8 */ 9 class Solution {10 public:11 ListNode* deleteDuplicates(ListNode* head) {12 if(!head){13 return head;14 }15 16 ListNode* newHead = new ListNode(-1);17 newHead->next = head;18 19 ListNode* prev = newHead;20 ListNode* p = head;21 22 while(p && p->next){23 24 if(p->val != p->next->val){25 prev = p;26 p = p->next;27 }else{28 int val = p->val;29 ListNode* n = p->next->next;30 while(n){31 if(n->val != val){32 break;33 }34 n = n->next;35 }36 prev->next = n;37 p = n;38 }39 }40 return newHead->next;41 }42 };
82. Remove Duplicates from Sorted List II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。