资源列表
queue
- 基于链表的队列，要动态创建和删除节点，效率较低，但是可以动态增长。-Based on the list of queue, to create dynamic and delete node, the efficiency is low, but can be dynamic growth
Triangle-War
- poj上只有三道极小极大算法的习题，poj1085是其中之一，并做了相关优化，时间：63ms-solve the poj 1085
custom_csp_solving
- Constraint Satisfaction Problems in prolog
bag
- 经典算法问题，背包问题。完整的C++源码程序，动态规划算法解答。
hello
- 约瑟夫环是学习单链表的一个比较好的垫脚石，是数据结构课程设计的一部分-Joseph is the study and a single list of a better stepping stone, is a data structure as part of the curriculum design
DIJKSTRA
- 数据结构 图章节 最短路径的一种方法————Dj- the short way
first
- 网络课程设计题目，计算检验和，采用端循环进位的算法-Online course design topics, checksum computation, using the algorithm end around carry
gohome
- 数据结构 go home 问题，数据结构 go home 问题-data structate go home promblems
queen
- 八皇后问题的非递归实现，为数据结构课程的必做实验，仅提出cpp文件，读者可以自行在编译器上编译运行。-Eight queens problem non-recursive implementation of the data structure course will do the experiment, only the proposed cpp file, readers can compile and run on the compiler.
conint
- 对于给定的n个正整数，请找出一种最佳的接力方式，使得采用该接力方式得到的正整数最大。 -For a given n positive integers, find a best way of relay, makes an integer is obtained by way of the relay is the largest
fluent-making-irregular-waves
- fluent造不规则波,结合fluent UDF功能造不规则波-fluent making irregular waves
Demo
- 有关进制转换的代码实现。此代码能实现任意十进制、二进制、八进制的转换-The hexadecimal conversion code implementation. This code can realize arbitrary binary, octal, decimal and transformation