Skip to content

【023-week1】个人学习总结 #33

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
kkkkk0cool opened this issue Jun 23, 2019 · 3 comments
Open

【023-week1】个人学习总结 #33

kkkkk0cool opened this issue Jun 23, 2019 · 3 comments

Comments

@kkkkk0cool
Copy link
Contributor

  1. 对于数组和链表的题目,通常考察的是对数据结构操作的熟练,需要学习的是如何精简程序使其更优雅,比如链表引入一个头部节点可以简化分支逻辑,使用二级指针来串联多层循环的指针等;
  2. 对于map和set的题目,需要具备用空间换时间的思想及对该类数据结构操作的了解;
  3. 堆栈和队列中困难题,比较难想到使用栈或队列来解决,这种题只能是多训练;
  4. 二分查找在有序序列中元素查找比较常用;
  5. 递归的思维需要重点培养,是机器思维,人脑要学习和熟练这种思维能力;
    IMG_0014
@sodexx7
Copy link
Contributor

sodexx7 commented Jun 23, 2019

对于map和set的题目,需要具备用空间换时间的思想及对该类数据结构操作的了解;
空间换时间 怎么理解?

@Peng282
Copy link
Contributor

Peng282 commented Jun 23, 2019

对于递归的总结,完全赞同,重要的是如何习惯和适应以及总结这种总结,总结出重复简单的重复子问题。

@knowledgeAlan
Copy link
Contributor

第二点完全赞同,利用空间复杂降低时间复杂度

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

4 participants