diff --git a/CMakeLists.txt b/CMakeLists.txt index a673a70..cac970a 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -5,7 +5,7 @@ set(CMAKE_CXX_STANDARD 14) # 遍历项目根目录下所有的 .cpp 文件 # 排除掉leetcode 下的代码,其不需要在Clion 中编译运行! -file (GLOB_RECURSE files ./*.cpp ./*/*.cpp ./*/*/*.cpp) +file (GLOB_RECURSE files ./*.cpp ./*/*.cpp ./*/*/*.cpp ./*/*/*/*.cpp) foreach (file ${files}) string(REGEX REPLACE ".+/(.+)\\..*" "\\1" exe ${file}) add_executable (${exe} ${file}) diff --git a/DataStructure/README.md b/DataStructure/README.md index 9a1467b..07e5451 100644 --- a/DataStructure/README.md +++ b/DataStructure/README.md @@ -12,19 +12,19 @@ 书写并运行源码使用的 IDE 是 `CLion`,其主要的配置文件是仓库根目录下的 `CMakeLists.txt` 文件。 ## 章节目录 -* [绪论](DS_0_Introduction) -* [线性表](DS_1_LinearList) -* [栈与队列](DS_2_StackAndQueue) -* [字符串](DS_3_String) -* [树与二叉树](DS_4_TreeAndBinaryTree) -* [图](DS_5_Graph) -* [查找](DS_6_Search) -* [排序](DS_7_Sort) +* [绪论](DataStructure/Src/DS_0_Introduction) +* [线性表](DataStructure/Src/DS_1_LinearList) +* [栈与队列](DataStructure/Src/DS_2_StackAndQueue) +* [字符串](DataStructure/Src/DS_3_String) +* [树与二叉树](DataStructure/Src/DS_4_TreeAndBinaryTree) +* [图](DataStructure/Src/DS_5_Graph) +* [查找](DataStructure/Src/DS_6_Search) +* [排序](DataStructure/Src/DS_7_Sort) ## 笔记及图床 所有笔记均是 markdown 文件,其中插图采用的图床是[Github图床](https://github.com/KimYangOfCat/PictureBed),使用jsDriver加速访问,若图片加载失败,直接点击该图片进行直接访问,后再重新刷新一次即可~ -## [PPT](PPT) +## [PPT](DataStructure/PPT) PPT 文件夹下存放的是 2021 王道考研视频课程讲解用的 PPT,以供大家快速查找知识点或着复习视频内容! diff --git a/DataStructure/DS_0_Introduction/DS_0_0_love.cpp b/DataStructure/Src/DS_0_Introduction/DS_0_0_love.cpp similarity index 100% rename from DataStructure/DS_0_Introduction/DS_0_0_love.cpp rename to DataStructure/Src/DS_0_Introduction/DS_0_0_love.cpp diff --git a/DataStructure/DS_1_LinearList/DS_1_0_SqList.cpp b/DataStructure/Src/DS_1_LinearList/DS_1_0_SqList.cpp similarity index 100% rename from DataStructure/DS_1_LinearList/DS_1_0_SqList.cpp rename to DataStructure/Src/DS_1_LinearList/DS_1_0_SqList.cpp diff --git a/DataStructure/DS_1_LinearList/DS_1_1_SqList.cpp b/DataStructure/Src/DS_1_LinearList/DS_1_1_SqList.cpp similarity index 100% rename from DataStructure/DS_1_LinearList/DS_1_1_SqList.cpp rename to DataStructure/Src/DS_1_LinearList/DS_1_1_SqList.cpp diff --git a/DataStructure/DS_1_LinearList/DS_1_2_LinkList1.cpp b/DataStructure/Src/DS_1_LinearList/DS_1_2_LinkList1.cpp similarity index 100% rename from DataStructure/DS_1_LinearList/DS_1_2_LinkList1.cpp rename to DataStructure/Src/DS_1_LinearList/DS_1_2_LinkList1.cpp diff --git a/DataStructure/DS_1_LinearList/DS_1_3_LinkList.cpp b/DataStructure/Src/DS_1_LinearList/DS_1_3_LinkList.cpp similarity index 100% rename from DataStructure/DS_1_LinearList/DS_1_3_LinkList.cpp rename to DataStructure/Src/DS_1_LinearList/DS_1_3_LinkList.cpp diff --git a/DataStructure/DS_1_LinearList/DS_1_4_DLinkList.cpp b/DataStructure/Src/DS_1_LinearList/DS_1_4_DLinkList.cpp similarity index 100% rename from DataStructure/DS_1_LinearList/DS_1_4_DLinkList.cpp rename to DataStructure/Src/DS_1_LinearList/DS_1_4_DLinkList.cpp diff --git a/DataStructure/DS_1_LinearList/DS_1_5_RLinkList.cpp b/DataStructure/Src/DS_1_LinearList/DS_1_5_RLinkList.cpp similarity index 100% rename from DataStructure/DS_1_LinearList/DS_1_5_RLinkList.cpp rename to DataStructure/Src/DS_1_LinearList/DS_1_5_RLinkList.cpp diff --git a/DataStructure/DS_1_LinearList/DS_1_6_RDLinkList.cpp b/DataStructure/Src/DS_1_LinearList/DS_1_6_RDLinkList.cpp similarity index 100% rename from DataStructure/DS_1_LinearList/DS_1_6_RDLinkList.cpp rename to DataStructure/Src/DS_1_LinearList/DS_1_6_RDLinkList.cpp diff --git a/DataStructure/DS_1_LinearList/DS_1_7_SLinkList.cpp b/DataStructure/Src/DS_1_LinearList/DS_1_7_SLinkList.cpp similarity index 100% rename from DataStructure/DS_1_LinearList/DS_1_7_SLinkList.cpp rename to DataStructure/Src/DS_1_LinearList/DS_1_7_SLinkList.cpp diff --git a/DataStructure/DS_2_StackAndQueue/DS_2_0_SqStack.cpp b/DataStructure/Src/DS_2_StackAndQueue/DS_2_0_SqStack.cpp similarity index 100% rename from DataStructure/DS_2_StackAndQueue/DS_2_0_SqStack.cpp rename to DataStructure/Src/DS_2_StackAndQueue/DS_2_0_SqStack.cpp diff --git a/DataStructure/DS_2_StackAndQueue/DS_2_1_ShStack.cpp b/DataStructure/Src/DS_2_StackAndQueue/DS_2_1_ShStack.cpp similarity index 100% rename from DataStructure/DS_2_StackAndQueue/DS_2_1_ShStack.cpp rename to DataStructure/Src/DS_2_StackAndQueue/DS_2_1_ShStack.cpp diff --git a/DataStructure/DS_2_StackAndQueue/DS_2_2_LiStack.cpp b/DataStructure/Src/DS_2_StackAndQueue/DS_2_2_LiStack.cpp similarity index 100% rename from DataStructure/DS_2_StackAndQueue/DS_2_2_LiStack.cpp rename to DataStructure/Src/DS_2_StackAndQueue/DS_2_2_LiStack.cpp diff --git a/DataStructure/DS_2_StackAndQueue/DS_2_3_SqQueue0.cpp b/DataStructure/Src/DS_2_StackAndQueue/DS_2_3_SqQueue0.cpp similarity index 100% rename from DataStructure/DS_2_StackAndQueue/DS_2_3_SqQueue0.cpp rename to DataStructure/Src/DS_2_StackAndQueue/DS_2_3_SqQueue0.cpp diff --git a/DataStructure/DS_2_StackAndQueue/DS_2_4_SqQueue1.cpp b/DataStructure/Src/DS_2_StackAndQueue/DS_2_4_SqQueue1.cpp similarity index 100% rename from DataStructure/DS_2_StackAndQueue/DS_2_4_SqQueue1.cpp rename to DataStructure/Src/DS_2_StackAndQueue/DS_2_4_SqQueue1.cpp diff --git a/DataStructure/DS_2_StackAndQueue/DS_2_5_SqQueue2.cpp b/DataStructure/Src/DS_2_StackAndQueue/DS_2_5_SqQueue2.cpp similarity index 100% rename from DataStructure/DS_2_StackAndQueue/DS_2_5_SqQueue2.cpp rename to DataStructure/Src/DS_2_StackAndQueue/DS_2_5_SqQueue2.cpp diff --git a/DataStructure/DS_2_StackAndQueue/DS_2_6_LiQueue0.cpp b/DataStructure/Src/DS_2_StackAndQueue/DS_2_6_LiQueue0.cpp similarity index 100% rename from DataStructure/DS_2_StackAndQueue/DS_2_6_LiQueue0.cpp rename to DataStructure/Src/DS_2_StackAndQueue/DS_2_6_LiQueue0.cpp diff --git a/DataStructure/DS_2_StackAndQueue/DS_2_7_LiQueue1.cpp b/DataStructure/Src/DS_2_StackAndQueue/DS_2_7_LiQueue1.cpp similarity index 100% rename from DataStructure/DS_2_StackAndQueue/DS_2_7_LiQueue1.cpp rename to DataStructure/Src/DS_2_StackAndQueue/DS_2_7_LiQueue1.cpp diff --git a/DataStructure/DS_2_StackAndQueue/DS_2_8_QueueApplication.cpp b/DataStructure/Src/DS_2_StackAndQueue/DS_2_8_QueueApplication.cpp similarity index 100% rename from DataStructure/DS_2_StackAndQueue/DS_2_8_QueueApplication.cpp rename to DataStructure/Src/DS_2_StackAndQueue/DS_2_8_QueueApplication.cpp diff --git a/DataStructure/DS_3_String/DS_3_0_SString.cpp b/DataStructure/Src/DS_3_String/DS_3_0_SString.cpp similarity index 100% rename from DataStructure/DS_3_String/DS_3_0_SString.cpp rename to DataStructure/Src/DS_3_String/DS_3_0_SString.cpp diff --git a/DataStructure/DS_3_String/DS_3_1_HString.cpp b/DataStructure/Src/DS_3_String/DS_3_1_HString.cpp similarity index 100% rename from DataStructure/DS_3_String/DS_3_1_HString.cpp rename to DataStructure/Src/DS_3_String/DS_3_1_HString.cpp diff --git a/DataStructure/DS_3_String/DS_3_2_LString.cpp b/DataStructure/Src/DS_3_String/DS_3_2_LString.cpp similarity index 100% rename from DataStructure/DS_3_String/DS_3_2_LString.cpp rename to DataStructure/Src/DS_3_String/DS_3_2_LString.cpp diff --git a/DataStructure/DS_3_String/DS_3_3_LString.cpp b/DataStructure/Src/DS_3_String/DS_3_3_LString.cpp similarity index 100% rename from DataStructure/DS_3_String/DS_3_3_LString.cpp rename to DataStructure/Src/DS_3_String/DS_3_3_LString.cpp diff --git a/DataStructure/DS_4_TreeAndBinaryTree/DS_4_0_BiTreeSq.cpp b/DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_0_BiTreeSq.cpp similarity index 100% rename from DataStructure/DS_4_TreeAndBinaryTree/DS_4_0_BiTreeSq.cpp rename to DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_0_BiTreeSq.cpp diff --git a/DataStructure/DS_4_TreeAndBinaryTree/DS_4_1_BiTreeLink.cpp b/DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_1_BiTreeLink.cpp similarity index 100% rename from DataStructure/DS_4_TreeAndBinaryTree/DS_4_1_BiTreeLink.cpp rename to DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_1_BiTreeLink.cpp diff --git a/DataStructure/DS_4_TreeAndBinaryTree/DS_4_2_BiTreeF.cpp b/DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_2_BiTreeF.cpp similarity index 100% rename from DataStructure/DS_4_TreeAndBinaryTree/DS_4_2_BiTreeF.cpp rename to DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_2_BiTreeF.cpp diff --git a/DataStructure/DS_4_TreeAndBinaryTree/DS_4_3_ThreadedBiTree.cpp b/DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_3_ThreadedBiTree.cpp similarity index 100% rename from DataStructure/DS_4_TreeAndBinaryTree/DS_4_3_ThreadedBiTree.cpp rename to DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_3_ThreadedBiTree.cpp diff --git a/DataStructure/DS_4_TreeAndBinaryTree/DS_4_4_TreeSq.cpp b/DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_4_TreeSq.cpp similarity index 100% rename from DataStructure/DS_4_TreeAndBinaryTree/DS_4_4_TreeSq.cpp rename to DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_4_TreeSq.cpp diff --git a/DataStructure/DS_4_TreeAndBinaryTree/DS_4_5_TreeSqLink.cpp b/DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_5_TreeSqLink.cpp similarity index 100% rename from DataStructure/DS_4_TreeAndBinaryTree/DS_4_5_TreeSqLink.cpp rename to DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_5_TreeSqLink.cpp diff --git a/DataStructure/DS_4_TreeAndBinaryTree/DS_4_6_TreeLink.cpp b/DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_6_TreeLink.cpp similarity index 100% rename from DataStructure/DS_4_TreeAndBinaryTree/DS_4_6_TreeLink.cpp rename to DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_6_TreeLink.cpp diff --git a/DataStructure/DS_4_TreeAndBinaryTree/DS_4_7_BST.cpp b/DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_7_BST.cpp similarity index 100% rename from DataStructure/DS_4_TreeAndBinaryTree/DS_4_7_BST.cpp rename to DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_7_BST.cpp diff --git a/DataStructure/DS_4_TreeAndBinaryTree/DS_4_8_AVL.cpp b/DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_8_AVL.cpp similarity index 100% rename from DataStructure/DS_4_TreeAndBinaryTree/DS_4_8_AVL.cpp rename to DataStructure/Src/DS_4_TreeAndBinaryTree/DS_4_8_AVL.cpp diff --git a/DataStructure/DS_5_Graph/DS_5_0_Arc.cpp b/DataStructure/Src/DS_5_Graph/DS_5_0_Arc.cpp similarity index 100% rename from DataStructure/DS_5_Graph/DS_5_0_Arc.cpp rename to DataStructure/Src/DS_5_Graph/DS_5_0_Arc.cpp diff --git a/DataStructure/DS_5_Graph/README.md b/DataStructure/Src/DS_5_Graph/README.md similarity index 100% rename from DataStructure/DS_5_Graph/README.md rename to DataStructure/Src/DS_5_Graph/README.md diff --git a/DataStructure/DS_6_Search/README.md b/DataStructure/Src/DS_6_Search/README.md similarity index 100% rename from DataStructure/DS_6_Search/README.md rename to DataStructure/Src/DS_6_Search/README.md diff --git a/DataStructure/DS_7_Sort/README.md b/DataStructure/Src/DS_7_Sort/README.md similarity index 100% rename from DataStructure/DS_7_Sort/README.md rename to DataStructure/Src/DS_7_Sort/README.md diff --git a/DataStructure/Src/README.md b/DataStructure/Src/README.md new file mode 100644 index 0000000..07e5451 --- /dev/null +++ b/DataStructure/Src/README.md @@ -0,0 +1,30 @@ +# 数据结构 + +此文件夹下为 2021 [王道考研](http://cskaoyan.com/forum.php)课程数据结构源代码!点击此下载[ 21王道数据结构 PDF](https://github.com/KimYangOfCat/2021-CSPostgraduate-408/releases/tag/%E8%BE%85%E5%AF%BC%E4%B9%A6%E7%B1%8D) + +## 语法 + +虽然都是.cpp文件,但其中的语法既有C++的语法也有部分C的语法! + +如果想要C++版本的源码,可以参考我学习数据结构时写的一些数据结构的C++版本源码![传送门](https://github.com/KimYangOfCat/Data_Structure) 在此~ + +## IDE +书写并运行源码使用的 IDE 是 `CLion`,其主要的配置文件是仓库根目录下的 `CMakeLists.txt` 文件。 + +## 章节目录 +* [绪论](DataStructure/Src/DS_0_Introduction) +* [线性表](DataStructure/Src/DS_1_LinearList) +* [栈与队列](DataStructure/Src/DS_2_StackAndQueue) +* [字符串](DataStructure/Src/DS_3_String) +* [树与二叉树](DataStructure/Src/DS_4_TreeAndBinaryTree) +* [图](DataStructure/Src/DS_5_Graph) +* [查找](DataStructure/Src/DS_6_Search) +* [排序](DataStructure/Src/DS_7_Sort) + +## 笔记及图床 +所有笔记均是 markdown 文件,其中插图采用的图床是[Github图床](https://github.com/KimYangOfCat/PictureBed),使用jsDriver加速访问,若图片加载失败,直接点击该图片进行直接访问,后再重新刷新一次即可~ + +## [PPT](DataStructure/PPT) +PPT 文件夹下存放的是 2021 王道考研视频课程讲解用的 PPT,以供大家快速查找知识点或着复习视频内容! + + diff --git a/README.md b/README.md index 259c1c7..75873c5 100644 --- a/README.md +++ b/README.md @@ -50,14 +50,14 @@ 如果想要C++版本的源码,可以参考我学习数据结构时写的一些数据结构的C++版本源码![传送门](https://github.com/KimYangOfCat/Data_Structure) 在此~ #### 章节目录 -* [绪论](DataStructure/DS_0_Introduction) -* [线性表](DataStructure/DS_1_LinearList) -* [栈与队列](DataStructure/DS_2_StackAndQueue) -* [字符串](DataStructure/DS_3_String) -* [树与二叉树](DataStructure/DS_4_TreeAndBinaryTree) -* [图](DataStructure/DS_5_Graph) -* [查找](DataStructure/DS_6_Search) -* [排序](DataStructure/DS_7_Sort) +* [绪论](DataStructure/Src/DS_0_Introduction) +* [线性表](DataStructure/Src/DS_1_LinearList) +* [栈与队列](DataStructure/Src/DS_2_StackAndQueue) +* [字符串](DataStructure/Src/DS_3_String) +* [树与二叉树](DataStructure/Src/DS_4_TreeAndBinaryTree) +* [图](DataStructure/Src/DS_5_Graph) +* [查找](DataStructure/Src/DS_6_Search) +* [排序](DataStructure/Src/DS_7_Sort) ### [计算机组成原理](ComputerOrganization) @@ -98,7 +98,7 @@ 王道系列起源于[王道考研论坛](http://cskaoyan.com/),从它的论坛中,你能找到不少经验贴,非常值得关注!而王道系列辅导书籍,题量充足,知识点全面,可能更适合科班考研🈶️ 一定专业课基础的同学。 -需要2021王道高清无水印PDF,可至[Release](https://github.com/KimYangOfCat/2021-CSPostgraduate-408/releases/tag/%E8%BE%85%E5%AF%BC%E4%B9%A6%E7%B1%8D)中下载。 +需要2021王道高清无水印PDF,可至 [Release](https://github.com/KimYangOfCat/2021-CSPostgraduate-408/releases/tag/%E8%BE%85%E5%AF%BC%E4%B9%A6%E7%B1%8D) 中下载。 ### 天勤系列 天勤系列,相比于王道更注重基础知识,,但是题量并没有王道的多。也正是由于它更注重基础,所以也许它更适合跨考计算机的同学。 @@ -106,7 +106,7 @@ 但是总的来说,辅导资料这一块儿还是适合自己的最好。所以对自己的知识储备有较为清晰的认识也许对你复习 408 更有帮助。 -需要2021天勤高清无水印PDF,可至[Release](https://github.com/KimYangOfCat/2021-CSPostgraduate-408/releases/tag/%E8%BE%85%E5%AF%BC%E4%B9%A6%E7%B1%8Dv1)中下载。 +需要2021天勤高清无水印PDF,可至 [Release](https://github.com/KimYangOfCat/2021-CSPostgraduate-408/releases/tag/%E8%BE%85%E5%AF%BC%E4%B9%A6%E7%B1%8Dv1) 中下载。 ## 教材 @@ -115,7 +115,7 @@ | ![数据结构](https://cdn.jsdelivr.net/gh/KimYangOfCat/CSPostgraduate-408-2021/imgs/book/DS0.jpg) | ![计算机组成原理](https://cdn.jsdelivr.net/gh/KimYangOfCat/CSPostgraduate-408-2021/imgs/book/CO0.jpg) | ![操作系统](https://cdn.jsdelivr.net/gh/KimYangOfCat/CSPostgraduate-408-2021/imgs/book/OS0.png) | ![计算机网络](https://cdn.jsdelivr.net/gh/KimYangOfCat/CSPostgraduate-408-2021/imgs/book/CN1.png) | ![计算机网络·自顶向下方法](https://cdn.jsdelivr.net/gh/KimYangOfCat/CSPostgraduate-408-2021/imgs/book/CN0.jpg) | ## 真题 -干净无水印的真题资源十分稀少可贵,在搜集的过程中,本仓库尽力找了一些干净无水印的资源,奈何个人力量有限,其中有些真题资源的质量仍不如人意。 +干净无水印的真题资源十分稀少可贵,在搜集的过程中,作者尽力找了一些干净无水印的资源,奈何个人力量有限,其中有些真题资源的质量仍不如人意。 目前本仓库只收录了[408 真题](408Exam),如果你有其他专业课或者更干净无水印的真题资源,欢迎提交 PR 或者在 issues 中提交相关资源的下载链接,感激不尽~