Skip to content
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

重新理解递归 #33

Open
lewenweijia opened this issue Oct 17, 2019 · 3 comments
Open

重新理解递归 #33

lewenweijia opened this issue Oct 17, 2019 · 3 comments

Comments

@lewenweijia
Copy link
Owner

lewenweijia commented Oct 17, 2019 •
edited
Loading 

递归?:
1. 栈溢出   -> 转成非递归/迭代
2. 警惕重复计算 -> 哈希表缓存计算结果 -> 动态规划

递归场景下? 的限制递归深度的考量, 循环引用问题
决心/精力/方法/技巧
@lewenweijia
Copy link
Owner Author 

数组/链表/栈/队列/散列表/堆
递归/排序/二分/哈希
跳表/二叉树/红黑树/递归树/图
dfs/bfs
字符串匹配 -> 哈希算法/KMP算法
Trie树/AC自动机/贪心算法/分治算法/回溯算法/动态规划

@lewenweijia
Copy link
Owner Author

lewenweijia commented Oct 17, 2019 •
edited
Loading 

// 理念
满足性能的前提下, 代码实现尽量简单易懂 -> KISS原则的哦
链表相对数组? -> 耗费更多的内存, 获得天然动态扩容的属性的啊

单(向)链表
循环单链表
双链表
循环双向链表
有序单链表

@lewenweijia
Copy link
Owner Author

[二叉树的面试算法]（八）之二叉树算法解题思路总结(26题)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@lewenweijia