leetcode:237 Delete Node in a Linked List－每日编程第四题

寒风中的易水

于 2015-12-10 14:28:35 发布

阅读量349

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/fjzpdkf/article/details/50249437

leetcode 专栏收录该内容

41 篇文章

订阅专栏

本文介绍了一种在单链表中删除指定节点（除尾节点外）的方法，通过将后一个节点的值复制到当前节点，并调整指针指向来实现删除操作。

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

Delete Node in a Linked List

Total Accepted: 47385 Total Submissions: 107608 Difficulty: Easy

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.

思路：

将后一个节点的值复制到当前节点，使用指针tem存储下一个节点。修改当前节点的next指针，最后删除tem。

 /**
  * Definition for singly-linked list.
  * struct ListNode {
  *     int val;
  *     ListNode *next;
  *     ListNode(int x) : val(x), next(NULL) {}
  * };
  */
 class Solution {
 public:
     void deleteNode(ListNode* node) {
         node->val=node->next->val;
         ListNode* tem = node->next;
         node->next = tem->next;
         delete tem;
     }
 };