题目要求
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 -> 4and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function.
题目解读：
他给出的node本来就是一个单向链表，要删除的节点也是这个节点
代码
/**
* 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)
return ;
node.val = node.next.val;
node.next = node.next.next;
}
}
