/**
* 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) {
ListNode * be = node->next;
do{
node->val = be->val;
if(be->next != NULL)
be = be->next, node = node->next;
else break;
}while(true);
node->next= NULL;
}
};
转载请注明原文地址: https://ju.6miu.com/read-1301600.html
