From 58f5cccd49b94b0e654a0df83cb61d4d0f35651e Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Mon, 7 Jun 2021 11:21:47 +0800
Subject: [PATCH] =?UTF-8?q?1171:=E4=BB=8E=E9=93=BE=E8=A1=A8=E4=B8=AD?=
 =?UTF-8?q?=E5=88=A0=E5=8E=BB=E6=80=BB=E5=92=8C=E5=80=BC=E4=B8=BA=E9=9B=B6?=
 =?UTF-8?q?=E7=9A=84=E8=BF=9E=E7=BB=AD=E8=8A=82=E7=82=B9?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...ZeroSumConsecutiveNodesFromLinkedList.java | 96 +++++++++++++++++++
 ...veZeroSumConsecutiveNodesFromLinkedList.md | 38 ++++++++
 2 files changed, 134 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/RemoveZeroSumConsecutiveNodesFromLinkedList.java
 create mode 100644 src/main/java/leetcode/editor/cn/RemoveZeroSumConsecutiveNodesFromLinkedList.md

diff --git a/src/main/java/leetcode/editor/cn/RemoveZeroSumConsecutiveNodesFromLinkedList.java b/src/main/java/leetcode/editor/cn/RemoveZeroSumConsecutiveNodesFromLinkedList.java
new file mode 100644
index 0000000..635a6d9
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/RemoveZeroSumConsecutiveNodesFromLinkedList.java
@@ -0,0 +1,96 @@
+//给你一个链表的头节点 head，请你编写代码，反复删去链表中由 总和 值为 0 的连续节点组成的序列，直到不存在这样的序列为止。 
+//
+// 删除完毕后，请你返回最终结果链表的头节点。 
+//
+// 
+//
+// 你可以返回任何满足题目要求的答案。 
+//
+// （注意，下面示例中的所有序列，都是对 ListNode 对象序列化的表示。） 
+//
+// 示例 1： 
+//
+// 输入：head = [1,2,-3,3,1]
+//输出：[3,1]
+//提示：答案 [1,2,1] 也是正确的。
+// 
+//
+// 示例 2： 
+//
+// 输入：head = [1,2,3,-3,4]
+//输出：[1,2,4]
+// 
+//
+// 示例 3： 
+//
+// 输入：head = [1,2,3,-3,-2]
+//输出：[1]
+// 
+//
+// 
+//
+// 提示： 
+//
+// 
+// 给你的链表中可能有 1 到 1000 个节点。 
+// 对于链表中的每个节点，节点的值：-1000 <= node.val <= 1000. 
+// 
+// Related Topics 链表 
+// 👍 122 👎 0
+
+package leetcode.editor.cn;
+
+import com.code.leet.entiy.ListNode;
+
+import java.util.HashMap;
+import java.util.Map;
+
+//1171:从链表中删去总和值为零的连续节点
+public class RemoveZeroSumConsecutiveNodesFromLinkedList{
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new RemoveZeroSumConsecutiveNodesFromLinkedList().new Solution();
+    }
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode removeZeroSumSublists(ListNode head) {
+        Map<Integer, ListNode> map = new HashMap<>();
+        int sum = 0;
+        ListNode temp = head;
+        while (temp != null) {
+            sum += temp.val;
+            while (temp.next != null && temp.next.val == 0) {
+                temp.next = temp.next.next;
+            }
+            if (sum == 0 || map.containsKey(sum)) {
+                if (sum == 0) {
+                    head = temp.next;
+                } else {
+                    map.get(sum).next = temp.next;
+                }
+                if (head != null) {
+                    map = new HashMap<>();
+                    temp = head;
+                    sum = head.val;
+                } else {
+                    return head;
+                }
+            }
+            map.put(sum, temp);
+            temp = temp.next;
+        }
+        return head;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/RemoveZeroSumConsecutiveNodesFromLinkedList.md b/src/main/java/leetcode/editor/cn/RemoveZeroSumConsecutiveNodesFromLinkedList.md
new file mode 100644
index 0000000..58957fe
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/RemoveZeroSumConsecutiveNodesFromLinkedList.md
@@ -0,0 +1,38 @@
+<p>给你一个链表的头节点&nbsp;<code>head</code>，请你编写代码，反复删去链表中由 <strong>总和</strong>&nbsp;值为 <code>0</code> 的连续节点组成的序列，直到不存在这样的序列为止。</p>
+
+<p>删除完毕后，请你返回最终结果链表的头节点。</p>
+
+<p>&nbsp;</p>
+
+<p>你可以返回任何满足题目要求的答案。</p>
+
+<p>（注意，下面示例中的所有序列，都是对&nbsp;<code>ListNode</code>&nbsp;对象序列化的表示。）</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>head = [1,2,-3,3,1]
+<strong>输出：</strong>[3,1]
+<strong>提示：</strong>答案 [1,2,1] 也是正确的。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>head = [1,2,3,-3,4]
+<strong>输出：</strong>[1,2,4]
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre><strong>输入：</strong>head = [1,2,3,-3,-2]
+<strong>输出：</strong>[1]
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li>给你的链表中可能有 <code>1</code> 到&nbsp;<code>1000</code>&nbsp;个节点。</li>
+	<li>对于链表中的每个节点，节点的值：<code>-1000 &lt;= node.val &lt;= 1000</code>.</li>
+</ul>
+<div><div>Related Topics</div><div><li>链表</li></div></div>\n<div><li>👍 122</li><li>👎 0</li></div>
\ No newline at end of file