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

【009-week3】算法训练营第三周学习总结 #279

Open
duoyuli opened this issue Jul 7, 2019 · 0 comments
Open

【009-week3】算法训练营第三周学习总结 #279

duoyuli opened this issue Jul 7, 2019 · 0 comments

Comments

@duoyuli
Copy link
Contributor

duoyuli commented Jul 7, 2019

第三周作业主要是 DFS 和 BFS。
DFS 其实就是暴力把所有的路径都搜索出来，它运用了回溯，保存这次的位置去深入搜索，都搜索完了再搜下一个位置，直到把所有最深位置都搜一遍。使用栈实现。
BFS 类似于搜层的意思，搜索相邻节点。使用队列实现。
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
@duoyuli