资源列表
stack_out_is_in
- 检测一个序列是否为一个合理的出栈顺序 leetcode题目-Detect whether a sequence to a reasonable stack order leetcode topics
28permutation
- 全排列的下一序位 leetcode题目 已编译通过输出正确-Full array of next-leetcode topics
24backTraversal
- 回溯最大路径的路径 树的数据结构 leetcode题目-The maximum data path back path tree structure leetcode topics
min_stack
- 最小栈的实现，时间复杂度为O(1) leetcode题目 辅助站实现-Flowering most implementations, the time complexity is O (1) leetcode topic auxiliary stations to achieve
MS
- 微软2014实习生在线测试题 详解 ac得分1-Microsoft Interns 2014 online test questions
kruskal
- 求加权连通图的最小生成树的算法示例，两个经典的最小生成树算法的较为简单理解的一个算法-Find weighted connected graph algorithm examples of the minimum spanning tree, two classic minimum spanning tree algorithm is relatively simple to understand an algorithm
Genetic-Algorithm-
- 用遗传算法解决0_1背包问题，比较经典,适合做参考论文-0_1 knapsack problem solving using genetic algorithms, more classic, suitable reference paper
Convert-arbitrary-hexadecimal-number
- 将十进制数转换为任意进制数，C语言代码，可以直接运行-Converts a decimal number to an arbitrary hexadecimal number, C language code can be run directly
Numberical-heat-transfer
- 数值传热学两个计算例子，附源代码，非常实用厉害-Numerical calculation of heat transfer two examples with source code, very useful powerful
AhoCorasickAlgo_Demo
- C#实现的AhoCorasicko多模匹配算法，并有简单的使用demo-AhoCorasicko multimode matching algorithm C# implementation, and simple to use demo
minimum-spanning-tree_Kruskal
- 一个C++实现的最小生成树,使用的是Kruskal(克鲁斯卡尔)算法.-C++ achieve a minimum spanning tree, using the Kruskal (Kruskal) algorithm.
minimum-spanning-tree_prim
- 用C++实现的最小生成树,使用Prim(普里姆)算法.-C++ achieved with the minimum spanning tree, using Prim (Prim) algorithm.