/**
* 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);
}
};