237.Delete Node in a Linked List

原创于 2015-10-08 18:52:32 发布 · 335 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #算法

leetcode OJ 专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一种在单链表中删除指定节点(非尾节点)的方法，通过将待删节点的值替换为后继节点的值，并调整指针指向来实现删除操作，无需遍历整个链表。

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

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.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */

public class Solution {
    /*
     * A->B->C
     * 想删除A，则把B的val赋值给A的val，然后把B->next赋值给A->next
     */
    public void deleteNode(ListNode node) {
        ListNode post = node.next;
        node.val = post.val;
        node.next = post.next;
    }
}