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.
package cn.magicdu; import cn.magicdu.extra.ListNode; public class _237_Delete_Node_in_a_Linked_List { public void deleteNode(ListNode node) { node.val = node.next.val; node.next = node.next.next; } }
时间: 2024-10-14 17:07:32