[Leetcode] 237. Delete Node in a Linked List 给出链表中的某个节点，删除该节点

最新推荐文章于 2024-04-28 11:18:16 发布

原创最新推荐文章于 2024-04-28 11:18:16 发布 · 199 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

LeeCode_Linked Lists

当前文章被收录于：

LeeCode_Linked Lists

14 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

本文介绍了一个在单链表中删除指定节点（除尾节点）的方法，通过修改节点值和指向下一个节点的指针，实现原地删除，无需返回任何值。示例展示了如何将包含多个元素的链表在给定特定节点值的情况下进行调整。

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.

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.

# 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