237. Delete Node in a Linked List

最新推荐文章于 2024-07-21 08:42:04 发布

i-Blue

最新推荐文章于 2024-07-21 08:42:04 发布

阅读量224

点赞数

分类专栏： LeetCode 链表文章标签： leetcode 单链表

本文链接：https://blog.csdn.net/u011567017/article/details/52799635

版权

LeetCode 同时被 2 个专栏收录

45 篇文章 0 订阅

订阅专栏

链表

1 篇文章 0 订阅

订阅专栏

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 -> 4after calling your function.

只给出了要删除的节点，并没有给出该节点的前一节点，

1）将后一节点的val赋给当前节点，然后删除后一节点。

2）将后一节点整体赋给当前节点，*node访问node指针所指内存。

class Solution {
public:
    /*void deleteNode(ListNode* node) {
        node->val = node->next->val;
        node->next = node->next->next;
    }*/
    void deleteNode(ListNode* node) {
        *node = *(node->next);     //node是一指针，指向一内存,*node就会访问该内存的值.
    }
};