https://leetcode.com/problems/delete-node-in-a-linked-list/description/
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.
1 //时间 O(1)－因为没有循环遍历 空间 （1）
2 public class LC_237_DeleteNodeInALinkedList {
3 public void deleteNode(ListNode node) {
4 if (node == null) return ;
5 //这道题不好，因为没有给头，所以无法遍历 也没有办法用IF 来判断
6 //假设当前节点就是NODE NODE 去抢下一个节点的值，然后再跳过去。 这里不用考虑地址空间这些
7 node.val = node.next.val ;
8 node.next = node.next.next ;
9 }
10 }
