LeetCode – Refresh – Remove Duplicates from Sorted List II

转载于 2015-03-22 16:58:00 发布 · 65 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/shuashuashua/p/4357587.html

本文提供了一种使用C++实现的算法，该算法用于移除单链表中所有重复出现的元素，确保每个节点的值只出现一次。通过引入一个虚拟头节点简化边界条件处理，并利用两个指针技巧高效地遍历和移除重复节点。

Notes:

1. Check when the loop finished. The last element still need to be remove.

2. when remove the current one, do not forget to move the pointer back to the prev->next

 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 || !head->next) return head;
13         ListNode *result = new ListNode(0);
14         result->next = head;
15         ListNode *prev = result;
16         bool flag = false;
17         while (head) {
18             if (head->next && head->val == head->next->val) {
19                 flag = true;
20                 head->next = head->next->next;
21                 continue;
22             }
23             if (flag) {
24                 prev->next = head->next;
25                 head = prev->next;
26                 flag = false;
27             } else {
28                 prev = head;
29                 head = head->next;
30             }
31         }
32         if (flag) prev->next = prev->next->next;
33         return result->next;
34     }
35 };