在O(1)时间复杂度删除链表节点 -LintCode

给定一个单链表中的一个等待被删除的节点(非表头或表尾)。请在在O(1)时间复杂度删除该链表节点。

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

#ifndef C372_H
#define C372_H
#include<iostream>
using namespace std;
class ListNode{
public:
    int val;
    ListNode *next;
    ListNode(int val)
    {
        this->val = val;
        this->next=NULL;
    }
};
class Solution {
public:
    /*
    * @param node: the node in the list should be deletedt
    * @return: nothing
    */
    void deleteNode(ListNode * node) {
        // write your code here
        if (node == NULL)
            return;
        ListNode *p = node->next;
        node->val = p->val;
        node->next = p->next;
        delete p;
    }
};
#endif