delete-node-in-a-linked-list

Delete Node in a Linked List – LeetCode 237

Problem

Description

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.

Answer

Original

Code

/**
 * 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;
        node->next = node->next->next;
    }
};

思路

简单的将下一个节点覆盖，思路奇特，看看就好。时间复杂度$O(1)$，空间复杂度$O(1)$。
耗时$13$ ms，排名$76.96\%$

Better

思路

还没看到更好的思路。