Skip to content

【086-week1】总结思考 #51

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.

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

Open
SherryShi0108 opened this issue Apr 19, 2019 · 2 comments
Open

【086-week1】总结思考 #51

SherryShi0108 opened this issue Apr 19, 2019 · 2 comments

Comments

@SherryShi0108
Copy link

第一周学习总结思考

总结:

  • 本周主要回顾了数组、链表、栈、队列、递归、排序及二分查找的一些内容,思考了几道算法题并用不同语言实现了一下

  • 在时间空间复杂度上面,在参考了LeetCode的Discuss后分析一道题的四五种解法的时间空间复杂度,参考给出的时间和占用内存进行思考

思考:

  1. 要注意边界条件,尤其是链表要思考null或者一个结点的情况

  2. 注意终止条件和中止条件,这个细节问题很容易偏差一位导致出问题

  3. 递归的一部分要再思考一下,关注递推公式,注意边界和终止条件

  4. 排序这一块参考了可视化的动态图解,比较容易理解(https://visualgo.net/en)

  5. 思考时间复杂度空间复杂度,多注意时间换取空间和空间换取时间的思想在代码中的体现

@hapiman
Copy link
Contributor

hapiman commented Apr 19, 2019

思考的5点总结比较到位

@jonjia
Copy link

jonjia commented Apr 20, 2019

厉害,看了 83 题

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants