LeetCode 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.


分析

1 只给出一个参数,就是待删除的那个结点,做法是将后一个结点的值赋值给这个结点,同时这个结点的next变成next的next


代码

public void deleteNode(ListNode node) {
        node.val = node.next.val;
        node.next = node.next.next;
    }

猜你喜欢

转载自blog.csdn.net/vvnnnn/article/details/80077463