372在O(1)時間複雜度刪除鏈表節點

給定一個單鏈表中的一個等待被刪除的節點(非表頭或表尾)。請在在O(1)時間複雜度刪除該鏈表節點。

樣例
Linked list is 1->2->3->4, and given node 3, delete the node in place 1->2->4

這裏寫代碼片/**
 * Definition of ListNode
 * class ListNode {
 * public:
 *     int val;
 *     ListNode *next;
 *     ListNode(int val) {
 *         this->val = val;
 *         this->next = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     * @param node: a node in the list should be deleted
     * @return: nothing
     */
    void deleteNode(ListNode *node) {
        node->val=node->next->val;
        node->next=node->next->next;// write your code here
    }
};