《数据结构》（浙大版）笔记+题解目录

素颜马尾好姑娘i 2022-04-21 20:48 191阅读 0赞

### 文章目录 ###

*   *   *  前言
         *  基本概念
         *  线性结构
         *  树
         *  图
         *  排序
         *  散列查找
         *  KMP

我的 GitHub： [callmePicacho][]

### 前言 ###

中国大学MOOC上浙大的《数据结构》广受好评，原因有二，一是基础，简单易懂，老师讲得也清楚，另一大优点就是配套的每周相应知识点的编程题了，有难有易，容易题帮助巩固知识点，难题开阔视野。

笔记加入了一些自己的想法，题解也有思路说明

课程地址：[点击跳转][Link 1]

现将笔记和题解记录如下

### 基本概念 ###

[基本概念][Link 2]

<table> 
 <thead> 
  <tr> 
   <th>题目名称</th> 
   <th>考察知识点</th> 
   <th>难易度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/82990246" rel="nofollow">最大子列和问题</a></td> 
   <td>时间复杂度、算法优化</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83015775" rel="nofollow">Maximum Subsequence Sum</a></td> 
   <td>时间复杂度</td> 
   <td>中等</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83029537" rel="nofollow">二分查找</a></td> 
   <td>二分查找算法</td> 
   <td>简单</td> 
  </tr> 
 </tbody> 
</table>

### 线性结构 ###

[线性表][Link 3]

[堆栈][Link 4]

[队列][Link 5]

<table> 
 <thead> 
  <tr> 
   <th>题目名称</th> 
   <th>考察知识点</th> 
   <th>难易度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83214908" rel="nofollow">两个有序链表序列的合并</a></td> 
   <td>线性表</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83244253" rel="nofollow">一元多项式的乘法与加法运算</a></td> 
   <td>线性表</td> 
   <td>中等</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83269991" rel="nofollow">Reversing Linked List</a></td> 
   <td>线性表</td> 
   <td>中等</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83302030" rel="nofollow">Pop Sequence</a></td> 
   <td>栈</td> 
   <td>中等</td> 
  </tr> 
 </tbody> 
</table>

### 树 ###

[树的定义][Link 6]

[二叉树的遍历][Link 7]

[二叉搜索树][Link 8]

[平衡二叉树][Link 9]

[堆][Link 10]

[哈夫曼树][Link 11]

[并查集的实现和优化][Link 12]

<table> 
 <thead> 
  <tr> 
   <th>题目名称</th> 
   <th>考察知识点</th> 
   <th>难易度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83538124" rel="nofollow">树的同构</a></td> 
   <td>树的性质</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83539009" rel="nofollow">List Leaves</a></td> 
   <td>树的建立与遍历</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83545926" rel="nofollow">Tree Traversals Again</a></td> 
   <td>树的遍历</td> 
   <td>中等</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83625326" rel="nofollow">是否同一棵二叉搜索树</a></td> 
   <td>BST的建立与遍历</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83653257" rel="nofollow">Root of AVL Tree</a></td> 
   <td>AVL的调整</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83658106" rel="nofollow">Complete Binary Search Tree</a></td> 
   <td>BST的花样(?)建立</td> 
   <td>中等</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83683953" rel="nofollow">二叉搜索树的操作集</a></td> 
   <td>BST的操作集合</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83714443" rel="nofollow">堆中的路径</a></td> 
   <td>最小堆的建立</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83831833" rel="nofollow">File Transfer</a></td> 
   <td>并查集</td> 
   <td>中等</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/83870849" rel="nofollow">Huffman Codes</a></td> 
   <td>哈夫曼树编码</td> 
   <td>中等</td> 
  </tr> 
 </tbody> 
</table>

### 图 ###

[图的定义][Link 13]

[图的遍历][Link 14]

[最短路径][Link 15]

[最小生成树][Link 16]

<table> 
 <thead> 
  <tr> 
   <th>题目名称</th> 
   <th>考察知识点</th> 
   <th>难易度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84034666" rel="nofollow">列出连通集</a></td> 
   <td>图的遍历</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84068599" rel="nofollow">Saving James Bond - Easy Version</a></td> 
   <td>图的遍历</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84094685" rel="nofollow">六度空间</a></td> 
   <td>图的遍历</td> 
   <td>中等</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84145804" rel="nofollow">哈利·波特的考试</a></td> 
   <td>最短路径</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84192009" rel="nofollow">旅游规划</a></td> 
   <td>最短路径</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84201998" rel="nofollow">公路村村通</a></td> 
   <td>最小生成树</td> 
   <td>简单</td> 
  </tr> 
 </tbody> 
</table>

### 排序 ###

[排序][Link 17]

<table> 
 <thead> 
  <tr> 
   <th>题目名称</th> 
   <th>考察知识点</th> 
   <th>难易度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84325540" rel="nofollow">排序</a></td> 
   <td>用来测试排序算法</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84327267" rel="nofollow">Insert or Merge</a></td> 
   <td>插入排序、归并排序</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84328364" rel="nofollow">Insertion or Heap Sort</a></td> 
   <td>插入排序、堆排序</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84339532" rel="nofollow">统计工龄</a></td> 
   <td>桶排序</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84347191" rel="nofollow">PAT Judge</a></td> 
   <td>结构体排序</td> 
   <td>中等</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84400411" rel="nofollow">Sort with Swap(0, i)</a></td> 
   <td>表排序</td> 
   <td>简单</td> 
  </tr> 
 </tbody> 
</table>

### 散列查找 ###

[散列查找][Link 18]

<table> 
 <thead> 
  <tr> 
   <th>题目名称</th> 
   <th>考察知识点</th> 
   <th>难易度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84471871" rel="nofollow">电话聊天狂人</a></td> 
   <td>散列查找</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84477582" rel="nofollow">Hashing</a></td> 
   <td>散列查找</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84491884" rel="nofollow">QQ帐户的申请与登陆</a></td> 
   <td>散列查找</td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84501507" rel="nofollow">Hashing - Hard Version</a></td> 
   <td>散列查找、拓扑排序</td> 
   <td>中等</td> 
  </tr> 
 </tbody> 
</table>

### KMP ###

<table> 
 <thead> 
  <tr> 
   <th>题目名称</th> 
   <th>考察知识点</th> 
   <th>难易度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://blog.csdn.net/liyuanyue2017/article/details/84567509" rel="nofollow">KMP 串的模式匹配</a></td> 
   <td>串的匹配</td> 
   <td>中等</td> 
  </tr> 
 </tbody> 
</table>

注：**Saving James Bond - Hard Version** 和 **关键活动** 实在没时间做了…

完结撒花~

[callmePicacho]: https://github.com/callmePicacho/Data-Structres
[Link 1]: https://www.icourse163.org/course/ZJU-93001
[Link 2]: https://blog.csdn.net/liyuanyue2017/article/details/82990565
[Link 3]: https://blog.csdn.net/liyuanyue2017/article/details/83244310
[Link 4]: https://blog.csdn.net/liyuanyue2017/article/details/83688288
[Link 5]: https://blog.csdn.net/liyuanyue2017/article/details/83688306
[Link 6]: https://blog.csdn.net/liyuanyue2017/article/details/83412796
[Link 7]: https://blog.csdn.net/liyuanyue2017/article/details/83548361
[Link 8]: https://blog.csdn.net/liyuanyue2017/article/details/83614914
[Link 9]: https://blog.csdn.net/liyuanyue2017/article/details/83652743
[Link 10]: https://blog.csdn.net/liyuanyue2017/article/details/83713957
[Link 11]: https://blog.csdn.net/liyuanyue2017/article/details/83744262
[Link 12]: https://blog.csdn.net/liyuanyue2017/article/details/83830634
[Link 13]: https://blog.csdn.net/liyuanyue2017/article/details/84029138
[Link 14]: https://blog.csdn.net/liyuanyue2017/article/details/84104075
[Link 15]: https://blog.csdn.net/liyuanyue2017/article/details/84145832
[Link 16]: https://blog.csdn.net/liyuanyue2017/article/details/84202310
[Link 17]: https://blog.csdn.net/liyuanyue2017/article/details/84339337
[Link 18]: https://blog.csdn.net/liyuanyue2017/article/details/84572145