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