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;        node.next = node.next.next;    }

[leetcode] 237. Delete Node in a Linked List 解题报告