1171 accepted. 4 ms, faster than 100.00% .

Author: aQuaYi

Algorithms/1171.remove-zero-sum-consecutive-nodes-from-linked-list/remove-zero-sum-consecutive-nodes-from-linked-list.go

@@ -6,6 +6,29 @@ import "github.com/aQuaYi/LeetCode-in-Go/kit"
 type ListNode = kit.ListNode
 
 func removeZeroSumSublists(head *ListNode) *ListNode {
+	headPre := &ListNode{
+		Val:  2000000, // bigger than 1000*1000
+		Next: head,
+	}
 
-	return nil
+	node := make(map[int]*ListNode, 1000)
+	stack, top := make([]int, 1000), -1
+	sum, cur := 0, headPre
+	for cur != nil {
+		sum += cur.Val
+		if node[sum] == nil {
+			node[sum] = cur
+			top++
+			stack[top] = sum
+		} else {
+			node[sum].Next = cur.Next
+			for stack[top] != sum {
+				node[stack[top]] = nil
+				top--
+			}
+		}
+		cur = cur.Next
+	}
+
+	return headPre.Next
 }

Algorithms/1171.remove-zero-sum-consecutive-nodes-from-linked-list/remove-zero-sum-consecutive-nodes-from-linked-list_test.go

@@ -61,7 +61,7 @@ func Test_removeZeroSumSublists(t *testing.T) {
 
 	for _, tc := range tcs {
 		head := kit.Ints2List(tc.head)
-		ans := removeZeroSumSublists(head)
+		ans := kit.List2Ints(removeZeroSumSublists(head))
 		a.Equal(tc.ans, ans, "输入:%v", tc)
 	}
 }