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 {
/*
* A->B->C
* 想删除A，则把B的val赋值给A的val，然后把B->next赋值给A->next
*/
public void deleteNode(ListNode node) {
ListNode post = node.next;
node.val = post.val;
node.next = post.next;
}
}