LeetCode237 删除链表中的节点

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

Given linked list – head = [4,5,1,9], which looks like following:

4 -> 5 -> 1 -> 9

Example 1:

Input: head = [4,5,1,9], node = 5
Output: [4,1,9]
Explanation: You are given the second node with value 5, the linked list
should become 4 -> 1 -> 9 after calling your function.
Example 2:

Input: head = [4,5,1,9], node = 1
Output: [4,5,9]
Explanation: You are given the third node with value 1, the linked list
should become 4 -> 5 -> 9 after calling your function.
Note:
链表至少有两个元素。
所有节点的值都是唯一的。
给定节点不是尾部，它始终是链表的有效节点。
不要从你的功能中返回任何东西。

思路：复制下一个节点的值，删除下一个节点。

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