【137-week3】学习总结 #812

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

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

Jump to bottom

Open

songsmith opened this issue May 17, 2019 · 0 comments

songsmith commented May 17, 2019 •

edited

Loading

作业

本周选了一道初级堆排序和一道初级 DFS 递归遍历题

学习总结

链表相关的题一定要先画图，找到思路后进行步骤模拟，再去写代码通过率会很高
针对堆数据结构相关的题更多的是依赖 lib 来实现，堆的插入时间复杂度为 O(log n)，查找时间复杂度为O(1)

songsmith mentioned this issue

算法训练营第三周作业 #299

Open

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment