237. Delete Node in a Linked List

xiaoxiao2021-02-28  2

237. 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. * struct ListNode { * int val; * struct ListNode *next; * }; */ void deleteNode(struct ListNode* node) { struct ListNode *aft = node->next ; node->val = aft->val; node->next = aft->next; }

转载请注明原文地址: https://www.6miu.com/read-850113.html

最新回复(0)