LeetCode 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.

題目意思：

　　寫一個函式刪除單連結串列中的某個結點，函式只給出了刪除的結點

解題思路：

　　只需要將刪除的結點與其下一個結點交換值即可，同時調整好連結串列指標

原始碼：

class Solution {
public:
    void deleteNode(ListNode* node) {
        if( node->next == NULL){
            delete node;
            node = NULL;
        }
        swap(node->val, node->next->val);
        ListNode* nextNode = node->next;
        node->next = nextNode->next;
        delete nextNode;
    }
};