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

/**
 * 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) {
        // write your code here
        ListNode* next = node -> next;
        node -> val = next -> val;
        node -> next = next -> next;
        next -> next = NULL;
        delete next;
    }
};