首页 > 代码库 > 237.单链表移除节点 Delete Node in a Linked List

237.单链表移除节点 Delete Node in a Linked List

Question

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 -> 4after calling your function.

Solution

Approach: Swap with Next Node [Accepted]

The usual way of deleting a node node from a linked list is to modify the next pointer of the node before it, to point to the node after it.

技术分享

Since we do not have access to the node before the one we want to delete, we cannot modify the next pointer of that node in any way. Instead, we have to replace the value of the node we want to delete with the value in the node after it, and then delete the node after it.

技术分享

技术分享

技术分享

Because we know that the node we want to delete is not the tail of the list, we can guarantee that this approach is possible.


  1. public void DeleteNode(ListNode node) {
  2. node.val = node.next.val;
  3. node.next = node.next.next;
  4. }



来自为知笔记(Wiz)


237.单链表移除节点 Delete Node in a Linked List