LeetCode 237 Delete Node in a Linked List（在鏈表中刪除節點）

LeetCode 237 Delete Node in a Linked List（在鏈表中刪除節點）

翻譯

給定一個訪問節點的路徑，寫一個函數去刪除在一個單向鏈表中除尾部以外的節點。

假設這個鏈表是1 -> 2 -> 3 -> 4，並且你被給予了第3個值為3的節點，那麼在調用你的函數之後這個鏈表應該變為1 -> 2 -> 4。

原文

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;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
    void deleteNode(ListNode* node) {
        if (node == NULL) {}
        else {
            ListNode* tmp = node->next;
            node->val = tmp->val;
            node->next = tmp->next;
            delete tmp;
        }
    }
};