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 is1 -> 2 -> 3 -> 4and you are given the third node with value3, the linked list should become1 -> 2 -> 4after calling your function.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public void deleteNode(ListNode node) {
        if (node == null) return;

        ListNode prev = null, cur = node;

        while (cur != null && cur.next != null){
            ListNode next = cur.next;
            cur.val = next.val;
            prev = cur;
            cur = next;
        }

        prev.next = null;
    }
}