Leetcode237:Delete Node in a Linked List

Posted

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode237: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.

 

 

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

 

以上是关于Leetcode237:Delete Node in a Linked List的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode笔记:237. Delete Node in a Linked List

LeetCode237-delete-node-in-a-linked-list

[LeetCode]237. Delete Node in a Linked List

Leetcode237. Delete Node in a Linked List

[LeetCode] 237. Delete Node in a Linked List

LeetCode OJ 237Delete Node in a Linked List