leetcode 腾讯精选练习（50 题）237.删除链表中的节点

最新推荐文章于 2022-10-30 10:27:27 发布

solejay

最新推荐文章于 2022-10-30 10:27:27 发布

阅读量125

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/m0_37991005/article/details/94044048

版权

leetcode 专栏收录该内容

50 篇文章 1 订阅

订阅专栏

原题目

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.

思路

第一遍解法

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
        return