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.

将删除节点的值用该节点的下一个节点值代替，同时将该节点的下一个节点的下一个节点连到该节点后面。

public class Solution {
public void deleteNode(ListNode node) {
ListNode p=node.next;
node.val=p.val;
node.next=p.next;
}
}