LeetCode题解：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 && node.next != null) {
            node.val = node.next.val;
            node.next = node.next.next;
        }
    }