Leetcode 237. Delete Node in a Linked List-删除链表的指定节点，不给链表的头节点

二十六画生的博客

已于 2022-04-05 10:58:05 修改

阅读量884

点赞数

于 2022-04-05 10:55:55 首次发布

本文链接：https://blog.csdn.net/u010002184/article/details/123965886

版权

笔试面经 LeetCode 剑指Offer 后端/大数据专栏收录该内容

226 篇文章 ¥9.90 ¥99.00

订阅专栏

超级会员免费看

在单链表中删除指定节点，但不提供链表头节点的引用。确保要删除的节点不是尾节点。给出两种方法及其示例和约束条件。

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

Write a function to delete a node in a singly-linked list. You will not be given access to the head of the list, instead you will be given access to the node to be deleted directly.

It is guaranteed that the node to be deleted is not a tail node in the list.

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.