lc237. Delete Node in a Linked List-优快云博客

博客围绕单链表节点删除问题展开，给出了删除单链表中（非尾节点）指定节点的示例，输入不同节点值，输出删除该节点后的链表。还给出解题思路，即给当前节点赋下个节点的值，next指向next.next，并表明代码使用Python3实现。

237. 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.

Given linked list -- head = [4,5,1,9], which looks like following:

Example 1:

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. Example 2:

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.

Note:

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.

思路：给当前节点赋下个节点的值，next指向next.next

代码：python3

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
复制代码