<p>Given the <code>head</code> of a linked list, we repeatedly delete consecutive sequences of nodes that sum to <code>0</code> until there are no such sequences.</p>

<p>After doing so, return the head of the final linked list.&nbsp; You may return any such answer.</p>

<p>&nbsp;</p>
<p>(Note that in the examples below, all sequences are serializations of <code>ListNode</code> objects.)</p>

<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> head = [1,2,-3,3,1]
<strong>Output:</strong> [3,1]
<strong>Note:</strong> The answer [1,2,1] would also be accepted.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> head = [1,2,3,-3,4]
<strong>Output:</strong> [1,2,4]
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> head = [1,2,3,-3,-2]
<strong>Output:</strong> [1]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li>The given linked list will contain between <code>1</code> and <code>1000</code> nodes.</li>
	<li>Each node in the linked list has <code>-1000 &lt;= node.val &lt;= 1000</code>.</li>
</ul>

/**
 * 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:
    ListNode* removeZeroSumSublists(ListNode* head) {
      vector<int>ans;
      ListNode*temp=head;
      while(temp!=NULL){
        ans.push_back(temp->val);
        temp=temp->next;
      } 
      if(head->next==NULL  && head->val==0){
        return NULL;
      } 
      else if(head->next==NULL && head->val!=0){
        return head;
      }
      for(int i=0;i<ans.size()-1;i++){
        int index=-1;
        int sum=ans[i];
        if(sum==0){
            ans[i]=-2000;
            continue;
        }
        for(int j=i+1;j<ans.size();j++){
           
            sum+=ans[j];
              if(sum==0){
                index=j;
                break;
            }
           
        }
        if(index!=-1){
            for(int k=i;k<=index;k++){
                ans[k]=-2000;
            }
            i=index;
        }
      }
      if(ans[ans.size()-1]==0){
        ans[ans.size()-1]=-2000;
      }
      ListNode*dummy=new ListNode(-1);
      ListNode*res=dummy;
      for(int i=0;i<ans.size();i++){
        if(ans[i]!=-2000){
            dummy->next=new ListNode(ans[i]);
            dummy=dummy->next;
        }
      }
      return res->next;
    }
};
14900