[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.

思路：

前提条件：删除链表中的给定结点

过程：判定给定结点是否为空，不为空的话值赋值为下一个结点的值，指针赋值为下一个结点的后向指针

代码实现：

/** * 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;    }}