/**
* 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) return;
ListNode * tmp = node->next;
node->val = node->next->val;
node->next = node->next->next;
delete tmp;
}
* 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) return;
ListNode * tmp = node->next;
node->val = node->next->val;
node->next = node->next->next;
delete tmp;
}
};
应该是删掉给定节点的下一个节点。