解题思路:利用给出的Node先覆盖Node.next的值,然后修改Node节点的next指向
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public void deleteNode(ListNode node) {
if(node == null) return;
node.val = node.next.val;
node.next = node.next.next;
}
}