leetcode | 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.

[CODE]

[java]  view plain copy

1. /** 
2.  * Definition for singly-linked list. 
3.  * public class ListNode { 
4.  *     int val; 
5.  *     ListNode next; 
6.  *     ListNode(int x) { val = x; } 
7.  * } 
8.  */  
9. public class Solution {  
10.     public void deleteNode(ListNode node) {  
11.         //input check  
12.         if(node==null) return;  
13.         node.val = node.next.val;  
14.         node.next = node.next.next;  
15.     }  
16. }