答疑 C/C++/ VC QQ 群：2508429
喜缺全书算法册
--缺陷让我们成长
何志丹 魏家瑜
喜缺（闻缺陷则喜）的意思是：高效暴露问题才能更有效的解决问题。
更多阅读与沟通：
最新版下载:
C++课程的免费讲义：https://edu.csdn.net/course/detail/38771
CSDN 下载频道：https://download.csdn.net/download/he_zhidan/88348653
最新版查看:
CSDN 博客：https://blog.csdn.net/he_zhidan/
源码下载：我的 CSDN 下载频道。
答疑：Ｑ群 2508429
目录
闻缺陷则喜之算法册..............................................................................................1
视频算法 ..................................................................................................................3
1. 二分查找 .............................................................................................................................4
1.1. 基础 ....................................................................................................................................4
1.2. 习题 ....................................................................................................................................8
最短路径 ................................................................................................................11
1. 深度优先搜索(BFS)最短路径的原理和 C++实现 ...............................................................11
1.1. 时间复杂度 ......................................................................................................................11
1.2. 使用前提 ..........................................................................................................................11
1.3. 典型场景 ..........................................................................................................................11
1.4. 可理解性强的解法 ..........................................................................................................12
1.5. 核心代码 ..........................................................................................................................12
1.6. 测试样例 ..........................................................................................................................13
1.7. 滚动队列优化 ..................................................................................................................14
1.8. 一个队列就够了 ..............................................................................................................15
2. 01BFS 最短距离的原理和 C++实现 ...................................................................................15
2.1. 时间复杂度 ......................................................................................................................15
2.2. 使用前提 ..........................................................................................................................16
2.3. 典型场景 ..........................................................................................................................16
2.4. 解题思路 ..........................................................................................................................16
