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.

此题只给了要删除的节点，为了保存前后节点的值，可以把下一个节点的值赋给当前节点，把下下给节点赋给当前节点的下一个节点，然后删除下一个节点即可。

public void deleteNode(ListNode node) {
if(node == null) return;
node.val = node.next.val;
ListNode tmp = node.next;
node.next = tmp.next;
}