237. Delete Node in a Linked List

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.

Solution,

Since we don't have the head node and previous node information. In order to delete this node, we have to manipulate the value of the node. 

  public void deleteNode(ListNode node) {  
     ListNode temp=node.next;  
     node.val=temp.val;  
     node.next=temp.next;  
     temp.next=null;  
   }