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 -> 4after calling your function.

思路：这个题有点坑，常规思路的删除节点可以看203. Remove Linked List Elements。

这个题只告诉了你要删除的节点，没有告诉你删除节点的val.

1 public class Solution {
2     public void deleteNode(ListNode node) {
3         node.val = node.next.val;
4         node.next = node.next.next;
5     }

[LeetCode] 237. Delete Node in a Linked List