https://leetcode-cn.com/problems/delete-middle-node-lcci/
思路:因为是单向链表,所以无法直接删除当前节点,那么将下一节点的值赋给当前节点,然后删除下一节点即可。
/**
* 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 *tmp=node->next;
node->val=tmp->val;
node->next=tmp->next;
delete tmp;
}
};