/**
 * 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; //将该“下一结点“删掉
    }
};