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.

题意：给出一个链表和要删除的结点，这个结点不是尾结点。

思路：因为java中是值传递，所以将后一结点的值赋值给当前结点，同时给next赋值为下一结点的next

代码如下：

class ListNode
{
    int val;
    ListNode next;
    ListNode(int x) { val = x; }
}

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