leetcode 237. 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.

题目分析
删除链表结点，把对应的指针接上就可以了。。。。

/** * 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) {        if(node ==null) return ;        node.val = node.next.val;        node.next=node.next.next;    }}