数据结构与算法 on wangzf

数据结构与算法 on wangzf https://wangzhefeng.com/note/data-structure-algorithm/ Recent content in 数据结构与算法 on wangzf Hugo zh-cn Thu, 04 Apr 2024 00:00:00 +0000 分治算法 https://wangzhefeng.com/note/2024/04/04/divide-conquer/ Thu, 04 Apr 2024 00:00:00 +0000 https://wangzhefeng.com/note/2024/04/04/divide-conquer/ <style> details { border: 1px solid #aaa; border-radius: 4px; padding: .5em .5em 0; } summary { font-weight: bold; margin: -.5em -.5em 0; padding: .5em; } details[open] { padding: .5em; } details[open] summary { border-bottom: 1px solid #aaa; margin-bottom: .5em; } img { pointer-events: none; } </style> <details><summary>目录</summary><p> <ul> <li><a href="#%E5%88%86%E6%B2%BB%E7%AE%97%E6%B3%95">分治算法</a></li> <li><a href="#%E5%88%86%E6%B2%BB%E6%90%9C%E7%B4%A2%E7%AD%96%E7%95%A5">分治搜索策略</a></li> <li><a href="#%E6%9E%84%E5%BB%BA%E6%A0%91%E9%97%AE%E9%A2%98">构建树问题</a></li> <li><a href="#%E6%B1%89%E8%AF%BA%E5%A1%94%E9%97%AE%E9%A2%98">汉诺塔问题</a></li> </ul> </p> 数据结构 https://wangzhefeng.com/note/2024/04/04/data-structure/ Thu, 04 Apr 2024 00:00:00 +0000 https://wangzhefeng.com/note/2024/04/04/data-structure/ <style> details { border: 1px solid #aaa; border-radius: 4px; padding: .5em .5em 0; } summary { font-weight: bold; margin: -.5em -.5em 0; padding: .5em; } details[open] { padding: .5em; } details[open] summary { border-bottom: 1px solid #aaa; margin-bottom: .5em; } img { pointer-events: none; } </style> <details><summary>目录</summary><p> <ul> <li><a href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%88%86%E7%B1%BB">数据结构分类</a> <ul> <li><a href="#%E9%80%BB%E8%BE%91%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E4%B8%8E%E9%9D%9E%E7%BA%BF%E6%80%A7">逻辑结构: 线性与非线性</a></li> <li><a href="#%E7%89%A9%E7%90%86%E7%BB%93%E6%9E%84-%E8%BF%9E%E7%BB%AD%E4%B8%8E%E5%88%86%E6%95%A3">物理结构: 连续与分散</a></li> </ul> </li> <li><a href="#%E5%9F%BA%E6%9C%AC%E6%95%B0%E6%8D%AE%E7%B1%BB%E5%9E%8B">基本数据类型</a></li> <li><a href="#%E6%95%B0%E5%AD%97%E7%BC%96%E7%A0%81">数字编码</a></li> <li><a href="#%E5%AD%97%E7%AC%A6%E7%BC%96%E7%A0%81">字符编码</a></li> <li><a href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E6%95%B0%E7%BB%84%E4%B8%8E%E9%93%BE%E8%A1%A8">数据结构-数组与链表</a> <ul> <li><a href="#%E6%95%B0%E7%BB%84--array">数组–array</a> <ul> <li><a href="#%E6%95%B0%E7%BB%84%E5%B8%B8%E7%94%A8%E6%93%8D%E4%BD%9C">数组常用操作</a> <ul> <li><a href="#1-%E5%88%9D%E5%A7%8B%E5%8C%96%E6%95%B0%E7%BB%84">1 初始化数组</a></li> <li><a href="#2-%E8%AE%BF%E9%97%AE%E5%85%83%E7%B4%A0">2 访问元素</a></li> <li><a href="#3-%E6%8F%92%E5%85%A5%E5%85%83%E7%B4%A0">3 插入元素</a></li> <li><a href="#4-%E5%88%A0%E9%99%A4%E5%85%83%E7%B4%A0">4 删除元素</a></li> <li><a href="#5-%E9%81%8D%E5%8E%86%E6%95%B0%E7%BB%84">5 遍历数组</a></li> <li><a href="#6-%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0">6 查找元素</a></li> <li><a href="#7-%E6%89%A9%E5%AE%B9%E6%95%B0%E7%BB%84">7 扩容数组</a></li> </ul> </li> <li><a href="#%E6%95%B0%E7%BB%84%E7%9A%84%E4%BC%98%E7%82%B9%E4%B8%8E%E5%B1%80%E9%99%90%E6%80%A7">数组的优点与局限性</a></li> <li><a href="#%E6%95%B0%E7%BB%84%E5%85%B8%E5%9E%8B%E5%BA%94%E7%94%A8">数组典型应用</a></li> </ul> </li> <li><a href="#%E9%93%BE%E8%A1%A8-linked-list">链表-linked list</a> <ul> <li><a href="#%E9%93%BE%E8%A1%A8%E5%B8%B8%E7%94%A8%E6%93%8D%E4%BD%9C">链表常用操作</a> <ul> <li><a href="#1-%E5%88%9D%E5%A7%8B%E5%8C%96%E9%93%BE%E8%A1%A8">1 初始化链表</a></li> <li><a href="#2-%E6%8F%92%E5%85%A5%E8%8A%82%E7%82%B9">2 插入节点</a></li> <li><a href="#3-%E5%88%A0%E9%99%A4%E8%8A%82%E7%82%B9">3 删除节点</a></li> <li><a href="#4-%E8%AE%BF%E9%97%AE%E8%8A%82%E7%82%B9">4 访问节点</a></li> <li><a href="#5-%E6%9F%A5%E6%89%BE%E8%8A%82%E7%82%B9">5 查找节点</a></li> </ul> </li> <li><a href="#%E6%95%B0%E7%BB%84-vs-%E9%93%BE%E8%A1%A8">数组 VS. 链表</a></li> <li><a href="#%E5%B8%B8%E8%A7%81%E9%93%BE%E8%A1%A8%E7%B1%BB%E5%9E%8B">常见链表类型</a></li> <li><a href="#%E9%93%BE%E8%A1%A8%E7%9A%84%E5%85%B8%E5%9E%8B%E5%BA%94%E7%94%A8">链表的典型应用</a></li> </ul> </li> <li><a href="#%E5%88%97%E8%A1%A8--list">列表–list</a> <ul> <li><a href="#%E5%88%97%E8%A1%A8%E5%B8%B8%E7%94%A8%E6%93%8D%E4%BD%9C">列表常用操作</a> <ul> <li><a href="#1-%E5%88%9D%E5%A7%8B%E5%8C%96%E5%88%97%E8%A1%A8">1 初始化列表</a></li> <li><a href="#2-%E8%AE%BF%E9%97%AE%E5%85%83%E7%B4%A0-1">2 访问元素</a></li> <li><a href="#3-%E6%8F%92%E5%85%A5%E4%B8%8E%E5%88%A0%E9%99%A4%E5%85%83%E7%B4%A0">3 插入与删除元素</a></li> <li><a href="#4-%E9%81%8D%E5%8E%86%E5%88%97%E8%A1%A8">4 遍历列表</a></li> <li><a href="#5-%E6%8B%BC%E6%8E%A5%E5%88%97%E8%A1%A8">5 拼接列表</a></li> <li><a href="#6-%E6%8E%92%E5%BA%8F%E5%88%97%E8%A1%A8">6 排序列表</a></li> </ul> </li> <li><a href="#%E5%88%97%E8%A1%A8%E5%AE%9E%E7%8E%B0">列表实现</a></li> </ul> </li> <li><a href="#%E5%86%85%E5%AD%98%E4%B8%8E%E7%BC%93%E5%AD%98">内存与缓存</a> <ul> <li><a href="#%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%AD%98%E5%82%A8%E8%AE%BE%E5%A4%87">计算机存储设备</a></li> <li><a href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E7%9A%84%E5%86%85%E5%AD%98%E6%95%88%E7%8E%87">数据结构的内存效率</a></li> <li><a href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E7%9A%84%E7%BC%93%E5%AD%98%E6%95%88%E7%8E%87">数据结构的缓存效率</a></li> </ul> </li> </ul> </li> <li><a href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E6%A0%88%E4%B8%8E%E9%98%9F%E5%88%97">数据结构-栈与队列</a> <ul> <li><a href="#%E6%A0%88">栈</a> <ul> <li><a href="#%E6%A0%88%E7%9A%84%E5%B8%B8%E7%94%A8%E6%93%8D%E4%BD%9C">栈的常用操作</a></li> <li><a href="#%E6%A0%88%E7%9A%84%E5%AE%9E%E7%8E%B0">栈的实现</a> <ul> <li><a href="#%E5%9F%BA%E4%BA%8E%E9%93%BE%E8%A1%A8%E7%9A%84%E5%AE%9E%E7%8E%B0">基于链表的实现</a></li> <li><a href="#%E5%9F%BA%E4%BA%8E%E6%95%B0%E7%BB%84%E7%9A%84%E5%AE%9E%E7%8E%B0">基于数组的实现</a></li> <li><a href="#%E4%B8%A4%E7%A7%8D%E5%AE%9E%E7%8E%B0%E5%AF%B9%E6%AF%94">两种实现对比</a></li> </ul> </li> <li><a href="#%E6%A0%88%E7%9A%84%E5%85%B8%E5%9E%8B%E5%BA%94%E7%94%A8">栈的典型应用</a></li> </ul> </li> <li><a href="#%E9%98%9F%E5%88%97">队列</a> <ul> <li><a href="#%E9%98%9F%E5%88%97%E5%B8%B8%E7%94%A8%E6%93%8D%E4%BD%9C">队列常用操作</a></li> <li><a href="#%E9%98%9F%E5%88%97%E5%AE%9E%E7%8E%B0">队列实现</a> <ul> <li><a href="#%E5%9F%BA%E4%BA%8E%E9%93%BE%E8%A1%A8%E7%9A%84%E5%AE%9E%E7%8E%B0-1">基于链表的实现</a></li> <li><a href="#%E5%9F%BA%E4%BA%8E%E6%95%B0%E7%BB%84%E7%9A%84%E5%AE%9E%E7%8E%B0-1">基于数组的实现</a></li> </ul> </li> <li><a href="#%E9%98%9F%E5%88%97%E5%85%B8%E5%9E%8B%E5%BA%94%E7%94%A8">队列典型应用</a></li> </ul> </li> <li><a href="#%E5%8F%8C%E5%90%91%E9%98%9F%E5%88%97">双向队列</a></li> </ul> </li> <li><a href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E5%93%88%E5%B8%8C%E8%A1%A8">数据结构-哈希表</a> <ul> <li><a href="#%E5%93%88%E5%B8%8C%E8%A1%A8">哈希表</a> <ul> <li><a href="#%E5%93%88%E5%B8%8C%E8%A1%A8%E5%B8%B8%E7%94%A8%E6%93%8D%E4%BD%9C">哈希表常用操作</a> <ul> <li><a href="#%E5%88%9D%E5%A7%8B%E5%8C%96%E5%93%88%E5%B8%8C%E8%A1%A8">初始化哈希表</a></li> <li><a href="#%E6%B7%BB%E5%8A%A0%E6%93%8D%E4%BD%9C">添加操作</a></li> <li><a href="#%E6%9F%A5%E8%AF%A2%E6%93%8D%E4%BD%9C">查询操作</a></li> <li><a href="#%E5%88%A0%E9%99%A4%E6%93%8D%E4%BD%9C">删除操作</a></li> <li><a href="#%E9%81%8D%E5%8E%86%E6%96%B9%E5%BC%8F">遍历方式</a></li> </ul> </li> <li><a href="#%E5%93%88%E5%B8%8C%E8%A1%A8%E7%AE%80%E5%8D%95%E5%AE%9E%E7%8E%B0">哈希表简单实现</a></li> <li><a href="#%E5%93%88%E5%B8%8C%E5%86%B2%E7%AA%81%E4%B8%8E%E6%89%A9%E5%AE%B9">哈希冲突与扩容</a></li> </ul> </li> <li><a href="#%E5%93%88%E5%B8%8C%E5%86%B2%E7%AA%81">哈希冲突</a></li> <li><a href="#%E5%93%88%E5%B8%8C%E7%AE%97%E6%B3%95">哈希算法</a></li> </ul> </li> <li><a href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E6%A0%91">数据结构-树</a> <ul> <li><a href="#%E4%BA%8C%E5%8F%89%E6%A0%91">二叉树</a></li> <li><a href="#%E4%BA%8C%E5%8F%89%E6%A0%91%E9%81%8D%E5%8E%86">二叉树遍历</a></li> <li><a href="#%E4%BA%8C%E5%8F%89%E6%A0%91%E6%95%B0%E7%BB%84%E8%A1%A8%E7%A4%BA">二叉树数组表示</a></li> <li><a href="#%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91">二叉搜索树</a></li> <li><a href="#avl-%E6%A0%91">AVL 树</a></li> </ul> </li> <li><a href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E5%A0%86">数据结构-堆</a> <ul> <li><a href="#%E5%A0%86">堆</a></li> <li><a href="#%E5%BB%BA%E5%A0%86%E6%93%8D%E4%BD%9C">建堆操作</a></li> <li><a href="#top-k-%E9%97%AE%E9%A2%98">Top-k 问题</a></li> </ul> </li> <li><a href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E5%9B%BE">数据结构-图</a> <ul> <li><a href="#%E5%9B%BE">图</a></li> <li><a href="#%E5%9B%BE%E5%9F%BA%E6%9C%AC%E6%93%8D%E4%BD%9C">图基本操作</a></li> <li><a href="#%E5%9B%BE%E7%9A%84%E9%81%8D%E5%8E%86">图的遍历</a></li> </ul> </li> <li><a href="#%E5%9B%BE%E8%AE%BA%E7%AE%80%E4%BB%8B">图论简介</a></li> <li><a href="#%E5%9B%BE%E7%9A%84%E8%A1%A8%E7%A4%BA">图的表示</a></li> <li><a href="#%E5%9B%BE%E7%9A%84%E9%81%8D%E5%8E%86-1">图的遍历</a> <ul> <li><a href="#%E5%B9%BF%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2">广度优先搜索</a></li> <li><a href="#%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2">深度优先搜索</a></li> </ul> </li> <li><a href="#%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E7%AE%97%E6%B3%95">最短路径算法</a> <ul> <li><a href="#%E6%97%A0%E6%9D%83%E5%9B%BE">无权图</a></li> <li><a href="#%E6%9C%89%E6%9D%83%E5%9B%BE">有权图</a> <ul> <li><a href="#%E8%BF%AA%E6%9D%B0%E6%96%AF%E7%89%B9%E6%8B%89%E7%AE%97%E6%B3%95-dijkstra">迪杰斯特拉算法 Dijkstra</a></li> <li><a href="#%E4%BD%9B%E6%B4%9B%E4%BC%8A%E5%BE%B7%E7%AE%97%E6%B3%95-floyd">佛洛伊德算法 Floyd</a></li> </ul> </li> </ul> </li> <li><a href="#%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0%91">最小生成树</a></li> <li><a href="#%E7%BD%91%E7%BB%9C%E6%B5%81%E5%BB%BA%E6%A8%A1">网络流建模</a></li> </ul> </p> 贪心算法 https://wangzhefeng.com/note/2024/04/04/greedy/ Thu, 04 Apr 2024 00:00:00 +0000 https://wangzhefeng.com/note/2024/04/04/greedy/ <style> details { border: 1px solid #aaa; border-radius: 4px; padding: .5em .5em 0; } summary { font-weight: bold; margin: -.5em -.5em 0; padding: .5em; } details[open] { padding: .5em; } details[open] summary { border-bottom: 1px solid #aaa; margin-bottom: .5em; } img { pointer-events: none; } </style> <details><summary>目录</summary><p> <ul> <li><a href="#%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95">贪心算法</a></li> <li><a href="#%E5%88%86%E6%95%B0%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98">分数背包问题</a></li> <li><a href="#%E6%9C%80%E5%A4%A7%E5%AE%B9%E9%87%8F%E9%97%AE%E9%A2%98">最大容量问题</a></li> <li><a href="#%E6%9C%80%E5%A4%A7%E5%88%87%E5%88%86%E4%B9%98%E7%A7%AF%E9%97%AE%E9%A2%98">最大切分乘积问题</a></li> </ul> </p> 算法复杂度分析 https://wangzhefeng.com/note/2024/04/03/algorithm-complexity-analysis/ Wed, 03 Apr 2024 00:00:00 +0000 https://wangzhefeng.com/note/2024/04/03/algorithm-complexity-analysis/ <style> details { border: 1px solid #aaa; border-radius: 4px; padding: .5em .5em 0; } summary { font-weight: bold; margin: -.5em -.5em 0; padding: .5em; } details[open] { padding: .5em; } details[open] summary { border-bottom: 1px solid #aaa; margin-bottom: .5em; } img { pointer-events: none; } </style> <details><summary>目录</summary><p> <ul> <li><a href="#%E7%AE%97%E6%B3%95%E6%95%88%E7%8E%87%E8%AF%84%E4%BC%B0">算法效率评估</a> <ul> <li><a href="#%E7%AE%97%E6%B3%95%E6%95%88%E7%8E%87%E7%9A%84%E5%AE%9E%E9%99%85%E6%B5%8B%E8%AF%95">算法效率的实际测试</a></li> <li><a href="#%E7%AE%97%E6%B3%95%E6%95%88%E7%8E%87%E7%9A%84%E7%90%86%E8%AE%BA%E4%BC%B0%E7%AE%97">算法效率的理论估算</a></li> <li><a href="#%E4%BB%80%E4%B9%88%E6%98%AF%E5%A4%8D%E6%9D%82%E5%BA%A6%E5%88%86%E6%9E%90">什么是复杂度分析</a></li> <li><a href="#%E4%B8%BA%E4%BB%80%E4%B9%88%E8%A6%81%E8%BF%9B%E8%A1%8C%E5%A4%8D%E6%9D%82%E5%BA%A6%E5%88%86%E6%9E%90">为什么要进行复杂度分析</a></li> <li><a href="#%E5%B8%B8%E7%94%A8%E7%9A%84%E5%A4%8D%E6%9D%82%E5%BA%A6%E5%88%86%E6%9E%90%E6%96%B9%E6%B3%95">常用的复杂度分析方法</a></li> </ul> </li> <li><a href="#%E8%BF%AD%E4%BB%A3%E4%B8%8E%E9%80%92%E5%BD%92">迭代与递归</a> <ul> <li><a href="#%E8%BF%AD%E4%BB%A3">迭代</a> <ul> <li><a href="#for-%E5%BE%AA%E7%8E%AF">for 循环</a></li> <li><a href="#while-%E5%BE%AA%E7%8E%AF">while 循环</a></li> <li><a href="#%E5%B5%8C%E5%A5%97%E5%BE%AA%E7%8E%AF">嵌套循环</a></li> </ul> </li> <li><a href="#%E9%80%92%E5%BD%92">递归</a></li> </ul> </li> <li><a href="#%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6">时间复杂度</a></li> <li><a href="#%E7%A9%BA%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6">空间复杂度</a></li> <li><a href="#%E5%85%B6%E4%BB%96%E5%A4%8D%E6%9D%82%E5%BA%A6">其他复杂度</a></li> <li><a href="#%E5%85%B6%E4%BB%96%E8%B5%84%E6%BA%90">其他资源</a></li> </ul> </p> 回溯算法 https://wangzhefeng.com/note/2023/02/02/backtrace/ Thu, 02 Feb 2023 00:00:00 +0000 https://wangzhefeng.com/note/2023/02/02/backtrace/ <style> details { border: 1px solid #aaa; border-radius: 4px; padding: .5em .5em 0; } summary { font-weight: bold; margin: -.5em -.5em 0; padding: .5em; } details[open] { padding: .5em; } details[open] summary { border-bottom: 1px solid #aaa; margin-bottom: .5em; } img { pointer-events: none; } </style> <details><summary>目录</summary><p> <ul> <li><a href="#%E5%88%86%E6%B2%BB%E7%AE%97%E6%B3%95">分治算法</a></li> <li><a href="#%E5%88%86%E6%B2%BB%E6%90%9C%E7%B4%A2%E7%AD%96%E7%95%A5">分治搜索策略</a></li> <li><a href="#%E6%9E%84%E5%BB%BA%E6%A0%91%E9%97%AE%E9%A2%98">构建树问题</a></li> <li><a href="#%E6%B1%89%E8%AF%BA%E5%A1%94%E9%97%AE%E9%A2%98">汉诺塔问题</a></li> </ul> </p> 排序算法 https://wangzhefeng.com/note/2023/02/02/sort/ Thu, 02 Feb 2023 00:00:00 +0000 https://wangzhefeng.com/note/2023/02/02/sort/ <style> details { border: 1px solid #aaa; border-radius: 4px; padding: .5em .5em 0; } summary { font-weight: bold; margin: -.5em -.5em 0; padding: .5em; } details[open] { padding: .5em; } details[open] summary { border-bottom: 1px solid #aaa; margin-bottom: .5em; } img { pointer-events: none; } </style> <details><summary>目录</summary><p> <ul> <li><a href="#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E6%A6%82%E8%BF%B0">排序算法概述</a> <ul> <li><a href="#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E8%AF%84%E4%BB%B7%E7%BB%B4%E5%BA%A6">排序算法评价维度</a></li> <li><a href="#%E7%90%86%E6%83%B3%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95">理想排序算法</a></li> </ul> </li> <li><a href="#%E9%80%89%E6%8B%A9%E6%8E%92%E5%BA%8F">选择排序</a></li> <li><a href="#%E5%86%92%E6%B3%A1%E6%8E%92%E5%BA%8F">冒泡排序</a></li> <li><a href="#%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F">插入排序</a></li> <li><a href="#%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F">快速排序</a></li> <li><a href="#%E5%BD%92%E5%B9%B6%E6%8E%92%E5%BA%8F">归并排序</a></li> <li><a href="#%E5%A0%86%E6%8E%92%E5%BA%8F">堆排序</a></li> <li><a href="#%E6%A1%B6%E6%8E%92%E5%BA%8F">桶排序</a></li> <li><a href="#%E8%AE%A1%E6%95%B0%E6%8E%92%E5%BA%8F">计数排序</a></li> <li><a href="#%E5%9F%BA%E6%95%B0%E6%8E%92%E5%BA%8F">基数排序</a></li> </ul> </p> 搜索算法 https://wangzhefeng.com/note/2023/02/02/search/ Thu, 02 Feb 2023 00:00:00 +0000 https://wangzhefeng.com/note/2023/02/02/search/ <style> details { border: 1px solid #aaa; border-radius: 4px; padding: .5em .5em 0; } summary { font-weight: bold; margin: -.5em -.5em 0; padding: .5em; } details[open] { padding: .5em; } details[open] summary { border-bottom: 1px solid #aaa; margin-bottom: .5em; } img { pointer-events: none; } </style> <details><summary>目录</summary><p> <ul> <li><a href="#%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE">二分查找</a> <ul> <li><a href="#%E9%97%AE%E9%A2%98">问题</a></li> <li><a href="#%E5%8F%8C%E9%97%AD%E5%8C%BA%E9%97%B4%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE">双闭区间二分查找</a> <ul> <li><a href="#%E7%AE%97%E6%B3%95">算法</a></li> <li><a href="#%E5%AE%9E%E7%8E%B0">实现</a></li> </ul> </li> <li><a href="#%E5%B7%A6%E9%97%AD%E5%8F%B3%E5%BC%80%E5%8C%BA%E9%97%B4%E4%BA%8C%E5%88%86%E6%B3%95">左闭右开区间二分法</a> <ul> <li><a href="#%E7%AE%97%E6%B3%95-1">算法</a></li> <li><a href="#%E5%AE%9E%E7%8E%B0-1">实现</a></li> </ul> </li> <li><a href="#%E4%BC%98%E7%82%B9%E4%B8%8E%E5%B1%80%E9%99%90%E6%80%A7">优点与局限性</a></li> </ul> </li> <li><a href="#%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E6%8F%92%E5%85%A5%E7%82%B9">二分查找插入点</a> <ul> <li><a href="#%E6%97%A0%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%E7%9A%84%E6%83%85%E5%86%B5">无重复元素的情况</a> <ul> <li><a href="#%E9%97%AE%E9%A2%98-1">问题</a></li> <li><a href="#%E7%AE%97%E6%B3%95-2">算法</a></li> <li><a href="#%E5%AE%9E%E7%8E%B0-%E5%8F%8C%E9%97%AD%E5%8C%BA%E9%97%B4">实现-双闭区间</a></li> <li><a href="#%E5%AE%9E%E7%8E%B0-%E5%B7%A6%E9%97%AD%E5%8F%B3%E5%BC%80%E5%8C%BA%E9%97%B4">实现-左闭右开区间</a></li> </ul> </li> <li><a href="#%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%E7%9A%84%E6%83%85%E5%86%B5">存在重复元素的情况</a> <ul> <li><a href="#%E9%97%AE%E9%A2%98-2">问题</a></li> <li><a href="#%E7%AE%97%E6%B3%95-3">算法</a></li> <li><a href="#%E5%AE%9E%E7%8E%B0-%E5%8F%8C%E9%97%AD%E5%8C%BA%E9%97%B4-1">实现-双闭区间</a></li> <li><a href="#%E5%AE%9E%E7%8E%B0-%E5%B7%A6%E9%97%AD%E5%8F%B3%E5%BC%80%E5%8C%BA%E9%97%B4-1">实现-左闭右开区间</a></li> </ul> </li> </ul> </li> <li><a href="#%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E8%BE%B9%E7%95%8C">二分查找边界</a> <ul> <li><a href="#%E6%9F%A5%E6%89%BE%E5%B7%A6%E8%BE%B9%E7%95%8C">查找左边界</a></li> <li><a href="#%E6%9F%A5%E6%89%BE%E5%8F%88%E8%BE%B9%E7%95%8C">查找又边界</a></li> </ul> </li> <li><a href="#%E5%93%88%E5%B8%8C%E4%BC%98%E5%8C%96%E7%AD%96%E7%95%A5">哈希优化策略</a> <ul> <li><a href="#%E7%BA%BF%E6%80%A7%E6%9F%A5%E6%89%BE--%E4%BB%A5%E6%97%B6%E9%97%B4%E6%8D%A2%E7%A9%BA%E9%97%B4">线性查找–以时间换空间</a></li> <li><a href="#%E5%93%88%E5%B8%8C%E6%9F%A5%E6%89%BE--%E4%BB%A5%E7%A9%BA%E9%97%B4%E6%8D%A2%E6%97%B6%E9%97%B4">哈希查找–以空间换时间</a></li> </ul> </li> <li><a href="#%E9%87%8D%E8%AF%86%E6%90%9C%E7%B4%A2%E7%AE%97%E6%B3%95">重识搜索算法</a> <ul> <li><a href="#%E6%9A%B4%E5%8A%9B%E6%90%9C%E7%B4%A2">暴力搜索</a></li> <li><a href="#%E8%87%AA%E9%80%82%E5%BA%94%E6%90%9C%E7%B4%A2">自适应搜索</a></li> <li><a href="#%E6%90%9C%E7%B4%A2%E6%96%B9%E6%B3%95%E9%80%89%E5%8F%96">搜索方法选取</a></li> </ul> </li> <li><a href="#%E5%8F%82%E8%80%83">参考</a></li> </ul> </p> 数据结构与算法概览 https://wangzhefeng.com/note/2022/05/07/data-structure-algorithm/ Sat, 07 May 2022 00:00:00 +0000 https://wangzhefeng.com/note/2022/05/07/data-structure-algorithm/ <style> details { border: 1px solid #aaa; border-radius: 4px; padding: .5em .5em 0; } summary { font-weight: bold; margin: -.5em -.5em 0; padding: .5em; } details[open] { padding: .5em; } details[open] summary { border-bottom: 1px solid #aaa; margin-bottom: .5em; } img { pointer-events: none; } </style> <details><summary>目录</summary><p> <ul> <li><a href="#%E6%97%A5%E5%B8%B8%E7%94%9F%E6%B4%BB%E4%B8%AD%E7%9A%84%E7%AE%97%E6%B3%95">日常生活中的算法</a></li> <li><a href="#%E7%AE%97%E6%B3%95">算法</a></li> <li><a href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84">数据结构</a></li> <li><a href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95%E7%9A%84%E5%85%B3%E7%B3%BB">数据结构与算法的关系</a></li> </ul> </p>