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.

这个例子的意思是给你第三个node，让你进行操作，把list变成后面那样。要做的只是change value 和改变 next。代码如下：

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

简单的有点……奇葩……