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 public class Solution { 2 public void deleteNode(ListNode node) { 3 if(node != null && node.next != null) { 4 node.val = node.next.val; 5 node.next = node.next.next; 6 } 7 } 8 }