leetcode707-Design Linked List

最新推荐文章于 2025-02-09 09:38:51 发布

原创最新推荐文章于 2025-02-09 09:38:51 发布 · 70 阅读

CC 4.0 BY-SA版权

185 篇文章

订阅专栏

本文是一位初次接触链表问题的作者分享的心得体会。面对链表的插入与删除操作，作者发现需要创建额外节点来表示“Node”，并考虑了边界情况如链表头部和尾部的操作。文章建议使用三个变量：head、tail 和 size 来管理和操作链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1st time to do this kind of problem, so it is hard to handle.

Error:

Do not know how to design. 1) need to create another node to represent the “Node” 2) use this node to handle
Need to think of edge cases: e.g. 1) when index == 2 and size == 2 in insert and delete 2) when insert at head, tail 3) when delete at head, tail
I think it is good to use 3 variables: head, tail, and size