237. Delete Node in a Linked List（C++）

最新推荐文章于 2024-06-26 11:12:06 发布

转载最新推荐文章于 2024-06-26 11:12:06 发布 · 113 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/19q3/p/5492985.html

文章标签：

#c/c++

本文介绍了一种在单链表中删除指定节点（除尾节点外）的方法，仅通过访问该节点来实现。提供了C++代码示例，展示了如何将当前节点的值替换为下一个节点的值，并调整指针指向以移除下一节点。

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

237. Delete Node in a Linked Lis

t

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function.

Subscribe to see which companies asked this question

代码实现：

 1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     ListNode *next;
 6  *     ListNode(int x) : val(x), next(NULL) {}
 7  * };
 8  */
 9 class Solution {
10 public:
11     void deleteNode(ListNode* node) {
12         node->val = node->next->val;
13         ListNode *tmp = node->next;
14         node->next = tmp->next;
15         delete tmp;
16     }
17 };