/**
* 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) {
if (node == NULL) {
} else {
ListNode* t = node->next;
node->val = t->val;
node->next = t->next;
delete t;
}
}
};