> For the complete documentation index, see [llms.txt](https://cai-sen-se.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://cai-sen-se.gitbook.io/leetcode/201-400/237.-shan-chu-lian-biao-zhong-de-jie-dian.md).

# 237. 删除链表中的节点

<https://leetcode-cn.com/problems/delete-node-in-a-linked-list/>

## 解法一：

看半天才懂题目要求，参数**只给了node**，要求删去这个node，且注明node不会是末尾结点。已知删除链表某结点一般要知道其前驱，本题只能从node及其后继入手，可以将node的后继结&#x70B9;**“搬”**&#x5230;node上，然后删去node的后继结点

```python
class Solution:
    def deleteNode(self, node):
        """
        :type node: ListNode
        :rtype: void Do not return anything, modify node in-place instead.
        """
        node.val = node.next.val    #复制后继的值
        node.next = node.next.next    #删除后继结点
```