【python3】leetcode 237. Delete Node in a Linked List （easy）

最新推荐文章于 2023-02-25 23:03:36 发布

原创最新推荐文章于 2023-02-25 23:03:36 发布 · 165 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 同时被 2 个专栏收录

126 篇文章

订阅专栏

python

120 篇文章

订阅专栏

本文介绍了一种在单链表中删除指定节点的有效方法，无需遍历整个链表即可实现。通过修改待删除节点的值和指向下一个节点的指针，使该节点从链表中消失。适用于链表操作和数据结构学习。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

237. Delete Node in a Linked List （easy）

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.

删除指定的单链表节点（题目说给的node不会是最后一个节点

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

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