mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-09 15:59:06 +01:00
cpp: add «1171. Remove Zero Sum Consecutive Nodes from Linked List»
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
parent
dcbe6a126c
commit
37d6c3400c
1 changed files with 43 additions and 0 deletions
43
cpp/remove-zero-sum-consecutive-nodes-from-linked-list.cpp
Normal file
43
cpp/remove-zero-sum-consecutive-nodes-from-linked-list.cpp
Normal file
|
@ -0,0 +1,43 @@
|
|||
#include <unordered_map>
|
||||
|
||||
#ifdef _MF_TEST
|
||||
struct ListNode {
|
||||
int val;
|
||||
ListNode *next;
|
||||
ListNode() : val(0), next(nullptr) {}
|
||||
ListNode(int x) : val(x), next(nullptr) {}
|
||||
ListNode(int x, ListNode *next) : val(x), next(next) {}
|
||||
};
|
||||
#endif
|
||||
|
||||
class Solution {
|
||||
public:
|
||||
ListNode *removeZeroSumSublists(ListNode *head) {
|
||||
ListNode front(0, head);
|
||||
|
||||
std::unordered_map<int, ListNode *> sums;
|
||||
|
||||
int sum = 0;
|
||||
for (ListNode *node = &front; node != nullptr; node = node->next) {
|
||||
sum += node->val;
|
||||
|
||||
if (auto it = sums.find(sum); it != sums.end()) {
|
||||
auto prev = it->second;
|
||||
node = prev->next;
|
||||
|
||||
int p = sum + node->val;
|
||||
while (p != sum) {
|
||||
sums.erase(p);
|
||||
node = node->next;
|
||||
p += node->val;
|
||||
}
|
||||
|
||||
prev->next = node->next;
|
||||
} else {
|
||||
sums[sum] = node;
|
||||
}
|
||||
}
|
||||
|
||||
return front.next;
|
||||
}
|
||||
};
|
Loading…
Reference in a new issue