LinkedList---Delete Node in the Middle of Singly Linked List

最新推荐文章于 2025-04-26 10:03:55 发布

zjj2015

最新推荐文章于 2025-04-26 10:03:55 发布

阅读量434

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/zjj2015/article/details/50776690

算法专栏收录该内容

131 篇文章

订阅专栏

本文介绍了一种在只拥有目标节点访问权限的情况下，删除单链表中指定节点的方法。通过将待删节点的值替换为下一个节点的值，并调整指针指向，实现高效删除操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node.

Have you met this question in a real interview? Yes
Example
Tags
Related Problems
Notes
Given 1->2->3->4, and node 3. return 1->2->4

/**
 * Definition for ListNode.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int val) {
 *         this.val = val;
 *         this.next = null;
 *     }
 * }
 */ 
public class Solution {
    /**
     * @param node: the node in the list should be deleted
     * @return: nothing
     */
    public void deleteNode(ListNode node) {
        node.val = node.next.val;
        node.next = node.next.next;
    }
}