├─第1章引言Introduction
│&nBSp; &nBSp;&nBSp; &nBSp;1-1学前必看这门课能给你什么.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第2章贪心GreeDY
│&nBSp; &nBSp;&nBSp; &nBSp;2-1贪心不等于我全都要.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;2-2朴素的贪心法（上）最优化策略.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;2-3朴素的贪心法（中）构造法.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;2-4朴素的贪心法（下）二分答案.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;2-5朴素贪心法的实战演练.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;2-6随机贪心法：多试几次也许会更好.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;2-7随机贪心法的实战演练.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;2-8图论中的贪心：实时导航系统.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;2-9搜索中的贪心：电脑鼠走迷宫大赛.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;2-10本章小结.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;2-11本章作业说明（看完说明再做题）.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第3章搜索基础BasicSearching
│&nBSp; &nBSp;&nBSp; &nBSp;3-1搜索法：看似枚举，但没那么简单.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;3-2搜索基础理论：状态，搜索树与状态关系图.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;3-3深度优先搜索（上）：最常用的搜索方法.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;3-4深度优先搜索（下）：常见的状态扩展模型.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;3-5深度优先搜索实战：中层领导不好当.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;3-6广度优先搜索：用空间换时间的搜索方法.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;3-8本章小结.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;3-9本章作业说明（看完再做题）.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第4章搜索进阶ADvancedSearching
│&nBSp; &nBSp;&nBSp; &nBSp;4-1双向广度优先搜索：你踏出1步，我踏出99步.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;4-2双向广度优先搜索实战：走迷宫问题.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;4-3迭代加深搜索：每一次都更深一点-.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;4-4迭代加深搜索实战：再战走迷宫问题.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;4-5启发式搜索：让盲目搜索变得智能.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;4-6A算法：最经典的启发式搜索.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;4-7IDA算法：迭代加深的A.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;4-8启发式搜索实战：游戏自动寻路.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;4-9搜索优化：若要树长高，剪枝不可少.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;4-10剪枝实战：木棍问题.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;4-11本章小结.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;4-12作业说明.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第5章动态规划基础DYnAMicProgrAMmingBasic
│&nBSp; &nBSp;&nBSp; &nBSp;5-1动态规划DP：超越算法的思维.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;5-2一个简单的例子：跳方格.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;5-3DP两种模式：记忆化搜索，递推+枚举.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;5-4DP三要素：阶段，状态，决策.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;5-5DP两前提：最优子结构，无后效性.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;5-6稍微复杂一点的例子：01背包和多重背包.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;5-7DP分析流程1：划分阶段.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;5-8DP分析流程2：定义状态.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;5-9DP分析流程3：确定决策.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;5-10本章小结.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;5-11本章作业说明（看完再做题）.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第6章动态规划进阶ADvancedDYnAMicProgrAMm
│&nBSp; &nBSp;&nBSp; &nBSp;6-1常见模型分析1：线性模型.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;6-2线性模型实战：青蛙过河.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;6-3常见模型分析2：串模型.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;6-4串模型实战：回文路径.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;6-5常见模型分析3：区间模型（上）.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;6-6常见模型分析3：区间模型（下）.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;6-7区间模型实战：字符串折叠.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;6-8常见模型分析4：树形模型.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;6-9树形模型实战：谷仓涂色.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;6-10常见模型分析5：状态压缩模型.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;6-11状态压缩模型实战：种草.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;6-12本章小结.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;6-13作业说明.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第7章算法综合实战全自动物流系统设计
│&nBSp; &nBSp;&nBSp; &nBSp;7-1实战项目与章节内容简介.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;7-2需求分析：物件装车.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;7-3算法设计与实现：物件装车.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;7-4需求分析：行车路线规划.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;7-5算法设计与实现：行车路线.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;7-6运行环境：基于Flutter和Nodejs的WebAPP.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;7-7环境配置：VSCode+Flutter.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;7-8环境配置：VSCode+Nodejs.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;7-9项目测试，调试，及最终效果演示.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;7-10本章小结.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第8章堆与堆的高级变种Heap
│&nBSp; &nBSp;&nBSp; &nBSp;8-1优先队列与堆：高级数据结构的敲门砖.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;8-2堆，一种特殊的二叉树.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;8-3堆的两种构建方法.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;8-4堆的插入.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;8-5堆的删除.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;8-6堆排序.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;8-7堆的实战与复杂度分析.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;8-8二项堆：可以合并的堆.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;8-9斐波那契堆：最复杂最强大的堆.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;8-10本章小结+作业说明.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第9章二叉搜索树基础binarySearchTree
│&nBSp; &nBSp;&nBSp; &nBSp;9-1二叉搜索树BST：为何它如雷贯耳.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;9-2BST的表示法.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;9-3BST的插入和查找.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;9-4BST的删除.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;9-5BST的灵活应用第K小元素.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;9-6BST的实战与复杂度分析.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;9-7拒绝BST退化：平衡二叉搜索树.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;9-8初识平衡化旋转.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;9-9本章小结+作业说明.mkv
│&nBSp;&nBSp;
├─第10章二叉搜索树的优化：平衡二叉搜索树
│&nBSp; &nBSp;&nBSp; &nBSp;10-1AVL树：没有它就没有Windows.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;10-2AVL树的插入，平衡化旋转以及平衡因子.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;10-3AVL树的删除，以及自底向上调整.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;10-4红黑树：应用最广泛的平衡树.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;10-5红黑树的插入，以及红黑性质.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;10-6红黑树的删除.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;10-7本章小结+作业说明.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第11章平衡树的平替：近似平衡二叉树iclass=new_tag
│&nBSp; &nBSp;&nBSp; &nBSp;11-1竞赛党来不及写红黑树怎么办？.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;11-2Treap=Tree+Heap.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;11-3Treap的插入和删除.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;11-4Treap的实战与复杂度分析.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;11-5Splay树：最节省空间的BST变体.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;11-6Splay树的插入.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;11-7Splay树的合并和删除.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;11-8Splay树的实战与复杂度分析.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;11-9虚二叉树：限制区间的BST.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;11-10虚二叉树的插入，查找和删除.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;11-11虚二叉树的实战与复杂度分析.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;11-12各种平衡BST性能横向对比+适用场景分析.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;11-13本章小结+作业说明.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第12章多维树形结构Multi-DIMensionalTreeS
│&nBSp; &nBSp;&nBSp; &nBSp;12-1多维空间操作需要什么样的树.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;12-2字典树Trie：高效的单词查询结构.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;12-3Trie的表示，查找，插入和删除.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;12-4Trie的实战与复杂度分析.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;12-5线段树：区域统计的强大工具.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;12-6线段树的构建与查找.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;12-7线段树的插入与删除.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;12-8线段树的实战与复杂度分析.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;12-9树状数组：压缩算法离不开它.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;12-10树状数组的建立和查找.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;12-11树状数组的插入和删除.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;12-12树状数组的实战和复杂度分析.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;12-13本章小结+作业说明.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第13章复杂链式结构ComplexLinkedStructure
│&nBSp; &nBSp;&nBSp; &nBSp;13-1数据结构不止有树，链表也可以很高级.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-2并查集：合并+查找+集合.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-3并查集的合并与查找.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-4并查集的实战与复杂度分析.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-5跳跃表：互联网时代的优化万金油.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-6跳跃表的构建和查找.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-7跳跃表的插入和删除.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-8跳跃表的实战与复杂度分析.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-9块状链表：和区块链是一回事吗.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-10块状链表的查找，分裂和构建.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-11块状链表的插入和删除.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-12块状链表的合并.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-13块状链表的实战与复杂度分析.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;13-14本章小结+作业说明.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第14章数据结构综合实战数据库的设计
│&nBSp; &nBSp;&nBSp; &nBSp;14-1什么是NoSQL数据库？.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;14-2需求分析1：表的建立及查询.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;14-3需求分析2：插入记录.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;14-4需求分析3：删除表和记录.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;14-5需求分析4：更新记录.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;14-6需求分析5：索引的建立及查询.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;14-7系统设计与数据结构选择.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;14-8实现与效果演示.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;14-9本章小结.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第15章 NOIP模拟赛（介于普及组和提高组之间的难度）
│&nBSp; &nBSp;&nBSp; &nBSp;15-1至15-5作业.docx
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第16章 ICPC模拟赛（介于网络预选赛和亚洲区域赛之间的难度）
│&nBSp; &nBSp;&nBSp; &nBSp;16-1至16-10作业.docx
│&nBSp; &nBSp;&nBSp; &nBSp;
├─第17章总结Conclusion
│&nBSp; &nBSp;&nBSp; &nBSp;17-1课程总结与回顾.mkv
│&nBSp; &nBSp;&nBSp; &nBSp;
└─资料
&nBSp; &nBSp;&nBSp; &nBSp;&nBSp;&nBSp;CodeRepo-master.zIP
&nBSp; &nBSp;&nBSp; &nBSp;&nBSp;&nBSp;FulfillmenTOPeration-master.zIP
&nBSp; &nBSp;&nBSp; &nBSp;&nBSp;&nBSp;NoSQLDatabase-master.zIP

*声明：课程资源购自网络，版权归原作者所有，仅供参考学习使用，严禁外传及商用，若侵犯到您的权益请联系客服删除。