Milly: jobseeker is right in that you don't delete the "node to be deleted". You delete the node that FOLLOWS the "node to be deleted", only after swapping the values of the two.

Milly, jobseeker's assumption is reasonable, we should not delete the node before removing it from the list (if it was created by the list)

The post by "jobseeker" assumes that we know the node BEFORE the node to be deleted. This assumption is not consistent with the problem definition, but makes it solvable.

node = node.next;

node.val = node.next.val; node.next = node.next.next;

node ->val=node->next->val; node ->next=node->next->next;

You have to use some pointer/memory trickery