From 779e7f5487d9efad649233f40f1ecfdc8a5e806b Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Mon, 7 Jun 2021 13:20:39 +0800
Subject: [PATCH] =?UTF-8?q?=E9=9D=A2=E8=AF=95=E9=A2=98=2002.03:=E5=88=A0?=
 =?UTF-8?q?=E9=99=A4=E4=B8=AD=E9=97=B4=E8=8A=82=E7=82=B9?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../editor/cn/DeleteMiddleNodeLcci.java       | 48 +++++++++++++++++++
 .../editor/cn/DeleteMiddleNodeLcci.md         | 17 +++++++
 2 files changed, 65 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/DeleteMiddleNodeLcci.java
 create mode 100644 src/main/java/leetcode/editor/cn/DeleteMiddleNodeLcci.md

diff --git a/src/main/java/leetcode/editor/cn/DeleteMiddleNodeLcci.java b/src/main/java/leetcode/editor/cn/DeleteMiddleNodeLcci.java
new file mode 100644
index 0000000..c9df35f
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/DeleteMiddleNodeLcci.java
@@ -0,0 +1,48 @@
+//若链表中的某个节点，既不是链表头节点，也不是链表尾节点，则称其为该链表的「中间节点」。 
+//
+// 假定已知链表的某一个中间节点，请实现一种算法，将该节点从链表中删除。 
+//
+// 例如，传入节点 c（位于单向链表 a->b->c->d->e->f 中），将其删除后，剩余链表为 a->b->d->e->f 
+//
+// 
+//
+// 示例： 
+//
+// 
+//输入：节点 5 （位于单向链表 4->5->1->9 中）
+//输出：不返回任何数据，从链表中删除传入的节点 5，使链表变为 4->1->9
+// 
+//
+// 
+// Related Topics 链表 
+// 👍 111 👎 0
+
+package leetcode.editor.cn;
+
+import com.code.leet.entiy.ListNode;
+
+//面试题 02.03:删除中间节点
+public class DeleteMiddleNodeLcci{
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new DeleteMiddleNodeLcci().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 void deleteNode(ListNode node) {
+        node.val = node.next.val;
+        node.next = node.next.next;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/DeleteMiddleNodeLcci.md b/src/main/java/leetcode/editor/cn/DeleteMiddleNodeLcci.md
new file mode 100644
index 0000000..789d407
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/DeleteMiddleNodeLcci.md
@@ -0,0 +1,17 @@
+<p>若链表中的某个节点，既不是链表头节点，也不是链表尾节点，则称其为该链表的「中间节点」。</p>
+
+<p>假定已知链表的某一个中间节点，请实现一种算法，将该节点从链表中删除。</p>
+
+<p>例如，传入节点 <code>c</code>（位于单向链表 <code>a->b->c->d->e->f</code> 中），将其删除后，剩余链表为 <code>a->b->d->e->f</code></p>
+
+<p> </p>
+
+<p><strong>示例：</strong></p>
+
+<pre>
+<strong>输入：</strong>节点 5 （位于单向链表 4->5->1->9 中）
+<strong>输出：</strong>不返回任何数据，从链表中删除传入的节点 5，使链表变为 4->1->9
+</pre>
+
+<p> </p>
+<div><div>Related Topics</div><div><li>链表</li></div></div>\n<div><li>👍 111</li><li>👎 0</li></div>
\ No newline at end of file