Shulou(Shulou.com)06/01 Report--

This article is about how LeetCode deletes intermediate nodes. The editor thinks it is very practical, so share it with you as a reference and follow the editor to have a look.

1. Title

Interview question 02.03. Delete intermediate node [1]

two。 Description

Implement an algorithm that deletes a node in the middle of an one-way linked list (that is, not the first or last node), assuming that you can only access that node.

Example:

Input: one-way linked list a-> b-> c-> d-> e-> f node c > result: no data is returned, but the linked list becomes a-> b-> d-> e-> f

3. Train of thought

To delete the intermediate node in the linked list, we can directly delete the next node of the specified intermediate node. The apparent result at this time is the deleted current node, but in fact the next node is deleted. At this time, the main operation is assignment, and the time complexity is O (1).

4. Implement public void deleteNode (ListNode node) {

/ / the val of the node to be deleted is assigned to the val of the next node

Node.val = node.next.val

/ then the next node of the node to be deleted points to the next node of the node to be deleted

Node.next = node.next.next

} Thank you for reading! This is the end of this article on "how to delete intermediate nodes in LeetCode". I hope the above content can be of some help to you, so that you can learn more knowledge. if you think the article is good, you can share it for more people to see!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.