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.

/**
* 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) {
if(node!=null&&node.next!=null){
node.val=node.next.val;
node.next=node.next.next;
}
}
}大概思路就是 把后一个的value给前面一个

把后一个的指针也给前面一个