【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;                    }}