/**
 * 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;  //将下一个点删掉

        // *(node)=*(node->next);
    }
};