leetcode题库-algorithm-pattern:算法模板,c++实现,包括最基础的数据结构和常用的算法实现!

上传者: 38681318 | 上传时间: 2024-04-13 20:43:24 | 文件大小: 6.78MB | 文件类型: ZIP
leetcode题库 description 数据结构和算法基础知识学习和总结。 Introduction 此项目是自己在准备找工作的时候,借助leetcode上的题目,对数据结构和算法的基础内容复习总结的。 基于Gitbook所写,代码实现使用C++语言。并且整个文档可以在上下载,文档中代码都是在Leetcode上经过测试并且顺利Accepted。Github上还上传了所有的代码,项目见。 常用的数据结构总结如下(个人总结,如有不对之处请指教): 数据结构是工具,算法是通过合适的工具解决特定问题的方法。也就是说,学习算法之前,最起码得了解那些常用的数据结构,了解它们的特性和缺陷。 注:第一部分C++基础部分的代码都在VC16.0(VS2019)或GCC(Clion2020)上测试过。有代码示例的地方,如果没有说明具体的平台,说明在两个平台上的支持是一样的,不一样的地方都会有说明。 推荐的刷题顺序:二叉树—>线性表—>排序算法—>死磕二叉树—>动态规划—>滑动窗口—>回溯法—>其他类型(顺序随意)。一定要先刷二叉树,先刷二叉树,先刷二叉树,重要的事情说三遍。。。 (说一下本人的复习情况

文件下载

资源详情

[{"title":"( 282 个子文件 6.78MB ) leetcode题库-algorithm-pattern:算法模板,c++实现,包括最基础的数据结构和常用的算法实现!","children":[{"title":"bubblesort.gif <span style='color:#111;'> 455.95KB </span>","children":null,"spread":false},{"title":"quicksort.gif <span style='color:#111;'> 327.21KB </span>","children":null,"spread":false},{"title":"rotate.gif <span style='color:#111;'> 38.52KB </span>","children":null,"spread":false},{"title":"sort_algorithm.jpg <span style='color:#111;'> 67.23KB </span>","children":null,"spread":false},{"title":"98.jpg <span style='color:#111;'> 46.71KB </span>","children":null,"spread":false},{"title":"99.jpg <span style='color:#111;'> 31.96KB </span>","children":null,"spread":false},{"title":"7.jpg <span style='color:#111;'> 28.65KB </span>","children":null,"spread":false},{"title":"3.jpg <span style='color:#111;'> 28.27KB </span>","children":null,"spread":false},{"title":"21.jpg <span style='color:#111;'> 26.13KB </span>","children":null,"spread":false},{"title":"22 (1).jpg <span style='color:#111;'> 24.60KB </span>","children":null,"spread":false},{"title":"2.jpg <span style='color:#111;'> 21.92KB </span>","children":null,"spread":false},{"title":"9.jpg <span style='color:#111;'> 20.46KB </span>","children":null,"spread":false},{"title":"8.jpg <span style='color:#111;'> 20.16KB </span>","children":null,"spread":false},{"title":"22.jpg <span style='color:#111;'> 14.71KB </span>","children":null,"spread":false},{"title":"23.jpg <span style='color:#111;'> 13.19KB </span>","children":null,"spread":false},{"title":"1.jpg <span style='color:#111;'> 8.25KB </span>","children":null,"spread":false},{"title":"memory-request-and-release.md <span style='color:#111;'> 36.22KB </span>","children":null,"spread":false},{"title":"sliding-window.md <span style='color:#111;'> 33.62KB </span>","children":null,"spread":false},{"title":"constructor-destructor.md <span style='color:#111;'> 33.27KB </span>","children":null,"spread":false},{"title":"graph.md <span style='color:#111;'> 29.20KB </span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'> 28.77KB </span>","children":null,"spread":false},{"title":"cpp-io-library.md <span style='color:#111;'> 28.63KB </span>","children":null,"spread":false},{"title":"binary-tree.md <span style='color:#111;'> 26.60KB </span>","children":null,"spread":false},{"title":"mobile-semantic-perfect-forward.md <span style='color:#111;'> 25.60KB </span>","children":null,"spread":false},{"title":"set-map.md <span style='color:#111;'> 21.91KB </span>","children":null,"spread":false},{"title":"linear-list.md <span style='color:#111;'> 20.22KB </span>","children":null,"spread":false},{"title":"string.md <span style='color:#111;'> 20.06KB </span>","children":null,"spread":false},{"title":"clib-errno.md <span style='color:#111;'> 18.89KB </span>","children":null,"spread":false},{"title":"clib-stdarg.md <span style='color:#111;'> 18.71KB </span>","children":null,"spread":false},{"title":"balanced-multipath-search-tree.md <span style='color:#111;'> 18.58KB </span>","children":null,"spread":false},{"title":"lambda.md <span style='color:#111;'> 16.04KB </span>","children":null,"spread":false},{"title":"stockjobbing.md <span style='color:#111;'> 14.40KB </span>","children":null,"spread":false},{"title":"smart-pointer.md <span style='color:#111;'> 13.97KB </span>","children":null,"spread":false},{"title":"divide-and-conquer-algorithm.md <span style='color:#111;'> 13.74KB </span>","children":null,"spread":false},{"title":"keywords-1.md <span style='color:#111;'> 13.29KB </span>","children":null,"spread":false},{"title":"stack-and-queue.md <span style='color:#111;'> 13.26KB </span>","children":null,"spread":false},{"title":"array-matrix.md <span style='color:#111;'> 13.17KB </span>","children":null,"spread":false},{"title":"oop-encapsulation.md <span style='color:#111;'> 12.31KB </span>","children":null,"spread":false},{"title":"gravel-pile.md <span style='color:#111;'> 11.90KB </span>","children":null,"spread":false},{"title":"oop-inheritance.md <span style='color:#111;'> 11.36KB </span>","children":null,"spread":false},{"title":"dynamic-programming-algorithm.md <span style='color:#111;'> 10.95KB </span>","children":null,"spread":false},{"title":"stick-to-binary-tree.md <span style='color:#111;'> 10.68KB </span>","children":null,"spread":false},{"title":"subsequences.md <span style='color:#111;'> 10.28KB </span>","children":null,"spread":false},{"title":"function-object.md <span style='color:#111;'> 10.01KB </span>","children":null,"spread":false},{"title":"rtti.md <span style='color:#111;'> 9.87KB </span>","children":null,"spread":false},{"title":"type-conversion.md <span style='color:#111;'> 9.71KB </span>","children":null,"spread":false},{"title":"clib-stdio.md <span style='color:#111;'> 9.10KB </span>","children":null,"spread":false},{"title":"backtracking-algorithm.md <span style='color:#111;'> 8.89KB </span>","children":null,"spread":false},{"title":"sort-algorithm.md <span style='color:#111;'> 8.73KB </span>","children":null,"spread":false},{"title":"backpack-questions.md <span style='color:#111;'> 8.67KB </span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'> 8.54KB </span>","children":null,"spread":false},{"title":"hash-table.md <span style='color:#111;'> 8.41KB </span>","children":null,"spread":false},{"title":"blocking-queue.md <span style='color:#111;'> 8.28KB </span>","children":null,"spread":false},{"title":"union-find.md <span style='color:#111;'> 7.93KB </span>","children":null,"spread":false},{"title":"SUMMARY.md <span style='color:#111;'> 7.44KB </span>","children":null,"spread":false},{"title":"thread-pool.md <span style='color:#111;'> 7.13KB </span>","children":null,"spread":false},{"title":"unordered_set-unordered_map.md <span style='color:#111;'> 7.11KB </span>","children":null,"spread":false},{"title":"auto-increment-attenuation.md <span style='color:#111;'> 7.05KB </span>","children":null,"spread":false},{"title":"balanced-binary-tree.md <span style='color:#111;'> 6.92KB </span>","children":null,"spread":false},{"title":"interview-algorithm.md <span style='color:#111;'> 6.76KB </span>","children":null,"spread":false},{"title":"catalan.md <span style='color:#111;'> 6.47KB </span>","children":null,"spread":false},{"title":"function-pointer-callback-function.md <span style='color:#111;'> 6.44KB </span>","children":null,"spread":false},{"title":"recursive-algorithm.md <span style='color:#111;'> 5.72KB </span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'> 5.62KB </span>","children":null,"spread":false},{"title":"c-cpp.md <span style='color:#111;'> 5.34KB </span>","children":null,"spread":false},{"title":"robbery.md <span style='color:#111;'> 5.34KB </span>","children":null,"spread":false},{"title":"master-theorem.md <span style='color:#111;'> 4.61KB </span>","children":null,"spread":false},{"title":"string-class.md <span style='color:#111;'> 4.58KB </span>","children":null,"spread":false},{"title":"string-class.md <span style='color:#111;'> 4.58KB </span>","children":null,"spread":false},{"title":"geometry-problems.md <span style='color:#111;'> 4.37KB </span>","children":null,"spread":false},{"title":"geometry-problems.md <span style='color:#111;'> 4.30KB </span>","children":null,"spread":false},{"title":"local-cache.md <span style='color:#111;'> 4.00KB </span>","children":null,"spread":false},{"title":"bfs-dfs.md <span style='color:#111;'> 3.86KB </span>","children":null,"spread":false},{"title":"cpp-rwlock.md <span style='color:#111;'> 3.65KB </span>","children":null,"spread":false},{"title":"raii.md <span style='color:#111;'> 3.63KB </span>","children":null,"spread":false},{"title":"smart-pointer.md <span style='color:#111;'> 3.31KB </span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'> 3.28KB </span>","children":null,"spread":false},{"title":"circle-queue.md <span style='color:#111;'> 3.14KB </span>","children":null,"spread":false},{"title":"classic-algorithm-problems.md <span style='color:#111;'> 3.13KB </span>","children":null,"spread":false},{"title":"cpp-interview-question.md <span style='color:#111;'> 3.12KB </span>","children":null,"spread":false},{"title":"pair-tuple.md <span style='color:#111;'> 2.93KB </span>","children":null,"spread":false},{"title":"greedy-algorithm.md <span style='color:#111;'> 2.92KB </span>","children":null,"spread":false},{"title":"bracket-matching.md <span style='color:#111;'> 2.60KB </span>","children":null,"spread":false},{"title":"search-algorithm.md <span style='color:#111;'> 2.54KB </span>","children":null,"spread":false},{"title":"binary-system.md <span style='color:#111;'> 2.42KB </span>","children":null,"spread":false},{"title":"mathematical-problems.md <span style='color:#111;'> 2.07KB </span>","children":null,"spread":false},{"title":"branch-and-bound.md <span style='color:#111;'> 2.04KB </span>","children":null,"spread":false},{"title":"double-thread-alternate-printing.md <span style='color:#111;'> 1.71KB </span>","children":null,"spread":false},{"title":"permutation-and-combination.md <span style='color:#111;'> 1.59KB </span>","children":null,"spread":false},{"title":"concurrency-and-multithreading.md <span style='color:#111;'> 1.47KB </span>","children":null,"spread":false},{"title":"deque-priority_queue.md <span style='color:#111;'> 1.40KB </span>","children":null,"spread":false},{"title":"recursive-algorithm.md <span style='color:#111;'> 1.32KB </span>","children":null,"spread":false},{"title":"pointers-and-references.md <span style='color:#111;'> 1.09KB </span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'> 1.06KB </span>","children":null,"spread":false},{"title":"protobuf.md <span style='color:#111;'> 886B </span>","children":null,"spread":false},{"title":"expression-evaluation.md <span style='color:#111;'> 761B </span>","children":null,"spread":false},{"title":"functional.md <span style='color:#111;'> 722B </span>","children":null,"spread":false},{"title":"expression-evaluation.md <span style='color:#111;'> 570B </span>","children":null,"spread":false},{"title":"basic-knowledge.md <span style='color:#111;'> 551B </span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'> 459B </span>","children":null,"spread":false},{"title":"......","children":null,"spread":false},{"title":"<span style='color:steelblue;'>文件过多,未全部展示</span>","children":null,"spread":false}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明