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 1 -> 2 -> 3 -> 4 is and you were given the third node with value 3 , the linked list should become 1 -> 2 -> 4 AF ter calling your function.

The difficulty with this question is that node in front of node cannot be known, so it can be solved by assigning values. Change the value of the point you want to delete to the value of the next point, and delete the next point. It is important to note that there is except the tail in this topic. Otherwise, boundary conditions need to be discussed.

 Public void Deletenode (ListNode node) {        = node.next.val;         = node.next.next;    }

237. Delete Node in a Linked List