2.3 Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node. EXAMPLE Input: the node c from the linked list a->b->c->d->e Result: nothing isreturned, but the new linked list looks like a- >b- >d->e

2.3 deleteNode

class ListNode {
    int val;
    ListNode next;
	
    ListNode(int val) {
        this.val = val;
        next = null;
    }
}

public void deleteNode(ListNode cur) {
    // Can not delete cur when it is the last node
    if (cur == null || cur.next == null) {
        return;
    }
    
    cur.val = cur.next.val;
    cur.next = cur.next.next;
}