本文探讨了在处理链表问题时避免使用递归方法，转而采用迭代解决方案的重要性。通过创建指向下一个链接级别的指针，跟踪头部和当前处理级别，直到当前链接为空，然后移动到下一级别，重复相同的过程。
Error:
misleading by the problem, it said stack cannot count as extra space. In here, we should use iterate solution.
- Assume we create the next link level
- keep track of next level head and next level current processing.
- move current link to its next
- repeat until current link is null, then move to next level, do the same thing.
扫一扫
209
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
