From 2937ccad358bebae96f05d339c99bd5cb74ec806 Mon Sep 17 00:00:00 2001 From: callmePicacho <38685653+callmePicacho@users.noreply.github.com> Date: Wed, 8 May 2019 20:08:30 +0800 Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=94=B9=E6=A0=BC=E5=BC=8F?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- README.md | 17 +++++++++-------- 1 file changed, 9 insertions(+), 8 deletions(-) diff --git a/README.md b/README.md index eca3f25..ec205b9 100644 --- a/README.md +++ b/README.md @@ -17,7 +17,7 @@ [基本概念](https://blog.csdn.net/liyuanyue2017/article/details/82990565) | 题目名称 | 考察知识点 | 难易度 | -| ------------------------------------------------------------ | -------------------- | ------ | +| :------------------------------------------------------------:|:--------------------:|:------:| | [最大子列和问题](https://blog.csdn.net/liyuanyue2017/article/details/82990246) | 时间复杂度、算法优化 | 简单 | | [Maximum Subsequence Sum](https://blog.csdn.net/liyuanyue2017/article/details/83015775) | 时间复杂度 | 中等 | | [二分查找](https://blog.csdn.net/liyuanyue2017/article/details/83029537) | 二分查找算法 | 简单 | @@ -31,7 +31,7 @@ [队列](https://blog.csdn.net/liyuanyue2017/article/details/83688306) | 题目名称 | 考察知识点 | 难易度 | -| ------------------------------------------------------------ | ---------- | ------ | +| :------------------------------------------------------------:|:--------------------:|:------:| | [两个有序链表序列的合并](https://blog.csdn.net/liyuanyue2017/article/details/83214908) | 线性表 | 简单 | | [一元多项式的乘法与加法运算](https://blog.csdn.net/liyuanyue2017/article/details/83244253) | 线性表 | 中等 | | [Reversing Linked List](https://blog.csdn.net/liyuanyue2017/article/details/83269991) | 线性表 | 中等 | @@ -52,8 +52,9 @@ [哈夫曼树](https://blog.csdn.net/liyuanyue2017/article/details/83744262) [并查集的实现和优化](https://blog.csdn.net/liyuanyue2017/article/details/83830634) -| 题目名称 | 考察知识点 | 难易度 | -| ------------------------------------------------------------ | ---------------- | ------ | + +| 题目名称 | 考察知识点 | 难易度 | +| :------------------------------------------------------------:|:--------------------:|:------:| | [树的同构](https://blog.csdn.net/liyuanyue2017/article/details/83538124) | 树的性质 | 简单 | | [List Leaves](https://blog.csdn.net/liyuanyue2017/article/details/83539009) | 树的建立与遍历 | 简单 | | [Tree Traversals Again](https://blog.csdn.net/liyuanyue2017/article/details/83545926) | 树的遍历 | 中等 | @@ -76,7 +77,7 @@ [最小生成树](https://blog.csdn.net/liyuanyue2017/article/details/84202310) | 题目名称 | 考察知识点 | 难易度 | -| ------------------------------------------------------------ | ---------- | ------ | +| :------------------------------------------------------------:|:--------------------:|:------:| | [列出连通集](https://blog.csdn.net/liyuanyue2017/article/details/84034666) | 图的遍历 | 简单 | | [Saving James Bond - Easy Version](https://blog.csdn.net/liyuanyue2017/article/details/84068599) | 图的遍历 | 简单 | | [六度空间](https://blog.csdn.net/liyuanyue2017/article/details/84094685) | 图的遍历 | 中等 | @@ -90,7 +91,7 @@ [排序](https://blog.csdn.net/liyuanyue2017/article/details/84339337) | 题目名称 | 考察知识点 | 难易度 | -| ------------------------------------------------------------ | ------------------ | ------ | +| :------------------------------------------------------------:|:--------------------:|:------:| | [排序](https://blog.csdn.net/liyuanyue2017/article/details/84325540) | 用来测试排序算法 | 简单 | | [Insert or Merge](https://blog.csdn.net/liyuanyue2017/article/details/84327267) | 插入排序、归并排序 | 简单 | | [Insertion or Heap Sort](https://blog.csdn.net/liyuanyue2017/article/details/84328364) | 插入排序、堆排序 | 简单 | @@ -103,7 +104,7 @@ [散列查找](https://blog.csdn.net/liyuanyue2017/article/details/84572145) | 题目名称 | 考察知识点 | 难易度 | -| ------------------------------------------------------------ | ------------------ | ------ | +| :------------------------------------------------------------:|:--------------------:|:------:| | [电话聊天狂人](https://blog.csdn.net/liyuanyue2017/article/details/84471871) | 散列查找 | 简单 | | [Hashing](https://blog.csdn.net/liyuanyue2017/article/details/84477582) | 散列查找 | 简单 | | [QQ帐户的申请与登陆](https://blog.csdn.net/liyuanyue2017/article/details/84491884) | 散列查找 | 简单 | @@ -118,4 +119,4 @@ 注：**Saving James Bond - Hard Version** 和 **关键活动** 实在没时间做了... -完结撒花~ \ No newline at end of file +完结撒花~