Leetcode no. 237

最新推荐文章于 2019-11-06 18:52:43 发布

原创最新推荐文章于 2019-11-06 18:52:43 发布 · 275 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

114 篇文章

订阅专栏

本文介绍了一种在单链表中删除指定节点（除尾节点外）的方法，仅通过访问该节点实现。通过修改当前节点的值为下一个节点的值，并调整指向关系来完成删除操作，最终使链表保持连续。

237. Delete Node in a Linked List

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 {
    public void deleteNode(ListNode node) {
        node.val= node.next.val;
        node.next= node.next.next;
    }
}