题目链接:https://www.acwing.com/problem/content/85/
题目如下:
/**
* 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) {
//此处的删除实际上是覆盖
//目标:让当前节点完全变成下一个节点的内容,从而杀掉当前节点
auto p=node->next;
node->val=p->val;
node->next=p->next;
delete p;
}
};