题目来源【Leetcode】
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function.
把要删除的节点的值变为下一个节点的值,然后next变为下下个节点,
class Solution {
public:
void deleteNode(ListNode* node) {
node->val = node->next->val;
node->next = node->next->next;
}
};
本文介绍了一种在给定链表节点的情况下删除该节点的方法。通过将待删节点的值替换为下一个节点的值,并调整指针指向,实现有效删除。适用于除尾节点外的任意节点。
384

被折叠的 条评论
为什么被折叠?



