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.

Given linked list -- head = [4,5,1,9], which looks like following:

 

Example 1:

Input: head = [4,5,1,9], node = 5
Output: [4,1,9]
Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.

Example 2:

Input: head = [4,5,1,9], node = 1
Output: [4,5,9]
Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.

中文理解：给出一个链表中的节点，删除该节点。

解题思路：将节点后面的值不断向前移动，倒数第二个节点的next设置为null即可，同时注意边界条件，node==null || node.next==null 直接return。

代码（java）：

class Solution {
    public void deleteNode(ListNode node) {
        if(node==null || node.next==null)return;
        else{
            while(node.next!=null && node.next.next!=null){
                node.val=node.next.val;
                node=node.next;
            }
            node.val=node.next.val;
            node.next=null;
        }
    }
}