/**
 * 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) {
       //已知该点的值和指针用伪装大法把它伪装成下一点的值与指针再把该点跳过
       node->val=node->next->val;
       node->next=node->next->next;
    }
};