We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://www.cnblogs.com/yudidi/p/12545581.html
如何递归反转链表,我参考的这篇博客
反转链表 (速记: 三指针迭代 or 123递归(1+reverse(2->3))) 配套练习: 92. 反转链表 II
删除链表元素 (速记: 设置dummyhead统一删除逻辑, 判断下一个节点而不是当前节点是否需要被删除) 代码编写过程复盘 配套练习 82. 删除排序链表中的重复元素 II 21. 合并两个有序链表
Q: 递归 反转链表的 空间复杂度分析
Q: 判断2个可能有环的链是否相交
Q:「判断2个可能有环的链是否相交」引申问题-交点在哪儿?环入口在哪儿?
The text was updated successfully, but these errors were encountered:
为什么引入dummy head? 以及何时引入dummy head
Sorry, something went wrong.
录播视频:链接:https://pan.baidu.com/s/18-kNYnxaxxKV45_cCfpH8g 密码在群里问
No branches or pull requests
讲解大纲,参考资料
https://www.cnblogs.com/yudidi/p/12545581.html
今天(20200328)讨论
反转链表 (速记: 三指针迭代 or 123递归(1+reverse(2->3)))
配套练习: 92. 反转链表 II
删除链表元素 (速记: 设置dummyhead统一删除逻辑, 判断下一个节点而不是当前节点是否需要被删除)
代码编写过程复盘
配套练习
82. 删除排序链表中的重复元素 II
21. 合并两个有序链表
今日遗留问题 TODO
Q: 递归 反转链表的 空间复杂度分析
Q: 判断2个可能有环的链是否相交
Q:「判断2个可能有环的链是否相交」引申问题-交点在哪儿?环入口在哪儿?
The text was updated successfully, but these errors were encountered: