首页 > 代码库 > Remove Duplicates from Sorted List II
Remove Duplicates from Sorted List II
Remove Duplicates from Sorted List II
Total Accepted: 17137 Total Submissions: 69046My SubmissionsGiven 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) {
ListNode *new_head, *curr_node, *next_node, *next2_node, *new_list_tail;
curr_node = head;
new_head = NULL;
bool is_duplicate;
while (curr_node) {
next_node = curr_node->next;
is_duplicate = false;
while (next_node && next_node->val == curr_node->val) {
next2_node = next_node->next;
delete next_node;
next_node = next2_node;
is_duplicate = true;
}
if (is_duplicate) {
delete curr_node;
} else {
if (NULL == new_head) {
new_head = curr_node;
new_list_tail = new_head;
} else {
new_list_tail->next = curr_node;
new_list_tail = curr_node;
}
}
curr_node = next_node;
}
if (new_head) {
new_list_tail->next = NULL;
}
return new_head;
}
};Remove Duplicates from Sorted List II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。