leetcode：Delete Node in a Linked List 【Java】

一、问题描述

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 {
    public void deleteNode(ListNode node) {
        ListNode nextNode = null;
        nextNode = node.next;
        if (nextNode != null) {
            node.val = nextNode.val;
            node.next = nextNode.next;
        }
    }
}