资源列表
java8-stream-example
- java8的stream基本用法，利用文件流实现了对文本的批量处理，文本信息的统计及信息的正删改查。- Java8 stream of basic usage, using file stream to achieve a batch of text processing, text information statistics and information is deleted.
Prim
- 经典的prim算法，采用贪心策略，求一个给定的加权连通图的最小生成树。- The classic prim algorithm, using the greedy strategy, for a given weighted connected graph of the minimum spanning tree.
Dijkstra
- 经典的Dijkstra算法，采用贪婪技术，考虑单起点最短路径问题：对于加权连通图的一个称为起点的给定节点，求出它到所有其他顶点之间的一系列最短路径。- The classical Dijkstra algorithm, the greedy technique, consider single source shortest path problem: for weighted connected graph of a known as the starting point of a
01packageProblem
- 经典的0-1背包算法，采用动态规划法。n个重量不同，价值不等的物品，放入一个承重量固定的背包中，单个物品不能拆分，求最大价值的组合。- Classic 0-1 knapsack algorithm, using dynamic programming method. N weight is different, the value of items, into a fixed weight of the backpack, a single item can not be split,
Binary tree
- binary tree code for algorithum
Que_Task
- 用一个循环队列来实现游戏中的主线任务接收与完成等操作。-VC++ and QueTask
PBoss_List
- 用单链表来实现一个用户信息添加、删除、查看等信息。-VC++ and CList
dsaa-in-c-code
- 数据结构与算法分析——c语言描述全书的c源码，对于学习有很大帮助-Data structure and algorithm analysis c language to describe the book c source code, learning a great help
ctci-5th-cPPcode
- ctci是一本程序员面试的好书，不过其中内容大部分有java实现，这里提供了全部的c++代码，供C++程序员学习-ctci is a programmer interview books, but most of its contents have java to achieve, there is provided a full c++ code for programmers to learn C++
KMP
- KMP算法解决了BF算法效率低下的问题，并且在子串前缀重复时进行了性能优化-KMP algorithm solves the problem of low efficiency of BF algorithm, and when the prefix substring repeat performance optimization
firtest2015.2
- vivado fir 测试工程,dds chansheng shuju ranhou gei fir -vivado fir
FixedSum
- 利用Hash查找的方式，寻找int数组中元素之和为固定和-Find a way to make use of Hash, looking int elements of the array and fixed and