Update solution 0237

leetcode/0237.Delete-Node-in-a-Linked-List/README.md

@@ -1,35 +1,64 @@
 # [237. Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)
 
+
 ## 题目
 
-Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
+Write a function to **delete a node** in a singly-linked list. You will **not** be given access to the `head` of the list, instead you will be given access to **the node to be deleted** directly.
 
-Given linked list -- head = [4,5,1,9], which looks like following:
+It is **guaranteed** that the node to be deleted is **not a tail node** in the list.
 
-![](https://assets.leetcode.com/uploads/2018/12/28/237_example.png)
+**Example 1:**
 
-Example 1:
+![https://assets.leetcode.com/uploads/2020/09/01/node1.jpg](https://assets.leetcode.com/uploads/2020/09/01/node1.jpg)
 
-```c
+```
 Input: head = [4,5,1,9], node = 5
 Output: [4,1,9]
-Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
+Explanation:You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
+
 ```
 
-Example 2:
+**Example 2:**
 
-```c
+![https://assets.leetcode.com/uploads/2020/09/01/node2.jpg](https://assets.leetcode.com/uploads/2020/09/01/node2.jpg)
+
+```
 Input: head = [4,5,1,9], node = 1
 Output: [4,5,9]
-Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
+Explanation:You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
+
 ```
 
-Note:
+**Example 3:**
 
-- The linked list will have at least two elements.
-- All of the nodes' values will be unique.
-- The given node will not be the tail and it will always be a valid node of the linked list.
-- Do not return anything from your function.
+```
+Input: head = [1,2,3,4], node = 3
+Output: [1,2,4]
+
+```
+
+**Example 4:**
+
+```
+Input: head = [0,1], node = 0
+Output: [1]
+
+```
+
+**Example 5:**
+
+```
+Input: head = [-3,5,-99], node = -3
+Output: [5,-99]
+
+```
+
+**Constraints:**
+
+- The number of the nodes in the given list is in the range `[2, 1000]`.
+- `1000 <= Node.val <= 1000`
+- The value of each node in the list is **unique**.
+- The `node` to be deleted is **in the list** and is **not a tail** node
 
 ## 题目大意
 
@@ -37,4 +66,29 @@ Note:
 
 ## 解题思路
 
-其实就是把后面的结点都覆盖上来即可。或者直接当前结点的值等于下一个结点，Next 指针指向下下个结点，这样做也可以，只不过中间有一个结点不被释放，内存消耗多一些。
+其实就是把后面的结点都覆盖上来即可。或者直接当前结点的值等于下一个结点，Next 指针指向下下个结点，这样做也可以，只不过中间有一个结点不被释放，内存消耗多一些。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func deleteNode(node *ListNode) {
+	node.Val = node.Next.Val
+	node.Next = node.Next.Next
+}
+```