[LeetCode] Delete Node in a Linked List

[LeetCode] Delete Node in a Linked List

Write a function to delete a node (cannot the tail) in a singly linked list, given only access to that node.

Supposed the linked list is1-> 2-> 3-> 4And you are given the third node with value 3, the linked list shoshould become1-> 2-> 4After calling your function.

Solutions

Make the value of the current node equal to the value of the next node, then the current node points to the next node of the next node, and finally Delete the next node of the node to be deleted.

Implementation Code

// Runtime: 1 MS/*** 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) {node. val = node. next. val; node. next = node. next. next ;}}