LeetCode-237. 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.

---------------------------------------------------------------------------------------------------------------------

思路

这个思路比较简单，比如1—>2—>3—>4，删除3。第一步将3的值改为4，即链表变为1—>2—>4—>4，然后改变原来节点3的next为3的next的next。

代码

public class Solution {    public void deleteNode(ListNode node) {         node.val = node.next.val;        node.next = node.next.next;    }}