Python实现"删除链表中的节点(Delete Node in a Linked List)"的一种方法

最新推荐文章于 2024-08-13 14:59:01 发布

求兵

最新推荐文章于 2024-08-13 14:59:01 发布

阅读量1.6k

点赞数 1

分类专栏： Algorithms

本文链接：https://blog.csdn.net/qiubingcsdn/article/details/82833507

版权

Algorithms 专栏收录该内容

106 篇文章 5 订阅

订阅专栏

写一个函数实现删除链表中的节点，给定的输入数据只有待删除的节点

给定链表--head = [4,5,1,9]，形式为

 4 -> 5 -> 1 -> 9

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.

注意：

链表至少有两个节点

所有节点的值均唯一，不重复

给定的节点不是尾节点，并且在链表中总是有效

函数不需要返回任何东西

1：node.val = node.next.val、node.next = node.next.next

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

算法题来自：https://leetcode-cn.com/problems/delete-node-in-a-linked-list/description/