Leetcode 237:Delete Node in a Linked List

最新推荐文章于 2024-09-15 15:43:59 发布

Code_J_xer

最新推荐文章于 2024-09-15 15:43:59 发布

阅读量398

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/Code_J_xer/article/details/51944627

版权

leetcode 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Leetcode—237

Delete Node in a Linked List
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.
【题目大意】：给出且仅给出链表中要删除的某一个结点，删除它
【解法】：将当前节点的下一个节点的值复制到当前节点，然后就可以删除下一个节点了。(相当于删除了当前节点)
【AC代码】：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
void deleteNode(struct ListNode* node) {
    if(node -> next != NULL){
        struct ListNode * temp = node -> next;
        node->val = temp->val;
        node->next = temp->next;
        free(temp);
    }
}