首页 > 代码库 > Remove Duplicates from Sorted List II
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 == NULL || head->next == NULL) return head;13 14 for (ListNode **prev = &head; (*prev) != NULL;) {15 int count = 0;16 ListNode *pter = *prev;17 while (pter != NULL && (pter->val) == (*prev)->val) {18 pter = pter->next;19 ++count;20 }21 if (count == 1) {22 prev = &((*prev)->next);23 } else {24 while ((*prev) != pter) {25 ListNode *entry = *prev;26 *prev = entry->next;27 delete entry;28 }29 }30 }31 32 return head;33 }34 };
Remove Duplicates from Sorted List II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。