237. Delete Node in a Linked List

//本文内容来自StarSight，欢迎访问。

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.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public void deleteNode(ListNode node) {
        node.val = node.next.val;
        if(node.next.next!=null)
            node.next = node.next.next;
        else
            node.next = null;
    }
}

刚开始题目没有看懂，给出的节点是要删除的节点，因此我们直接把下一个节点的信息移到这一个节点，删除下一个节点即可。