思路:
遍历得到前缀和,前缀和相等的就可以删除,
得到前后对照的表,右边越右越好,从左往右再遍历,遇到对应的直接跳转,写的挺垃圾的,大家看个乐
/**
* Definition for singly-linked list.
* 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) {}
* };
*/
class Solution {
public:
vector <int> before;
int left[2100000];
int right[2100000];
int ifOk[1100];
int l;
ListNode* removeZeroSumSublists(ListNode* head) {
getBefore(head, 0);
l = before.size();
for(int i = 0; i < 2100000; i++){
left[i] = -1;
right[i] = -1;
}
for(int i = 0; i < l; i++){
if(left[before[i]] == -1){
left[before[i]] = i;
}else{
right[before[i]] = i;
}
}
ListNode *temp = new ListNode;
temp->next = head;
getSon(0, temp, head);
return temp->next;
}
void getBefore(ListNode* node, int val){
before.push_back(val + 1000005);
if(node != nullptr){
getBefore(node->next, val + node->val);
}
}
void getSon(int index, ListNode * p, ListNode *now){
// cout << index << endl;
if(index == l - 1){
return;
}
int temp = right[before[index]];
if(temp == -1){
getSon(index + 1, now, now->next);
}else{
right[before[index]] = -1;
now = getNode(now, temp - index);
if(now == nullptr){
//cout << "?";
p->next = now;
return;
}
p->next = now;
getSon(temp, p, now);
}
}
ListNode *getNode(ListNode* node, int index){
while(index > 0){
node = node ->next;
index--;
}
return node;
}
};