搜索资源列表
MKing
- 猴子选大王，程序采用了循环链表实现。含有注释，具体操作依据可执行文件。-monkey king elections, the procedures used to achieve Chain cycle. Notes contain the specific basis for executable files.
monkey~~~~
- 一个简单的数据结构 解决经典的猴子选大王问题-a simple data structure to solve the classic problem of monkeys elected king
Yueshefu
- 一个汇编语言编写的程序，用来实现约瑟夫环，编写此程序时的具体问题是猴子选大王-an assembly language prepared by the procedures used to achieve Joseph Central, this program will prepare specific issues in the election monkey king
monkey_ok
- 实现猴子选大王的程序,已经调通了!! 猴子的密码是3,如果密码改变,可以在相宜地方加上for循环-achieve monkey king of the election process, Qualcomm has been transferred! ! Monkey is the password 3, password changes, coupled with the inexpensive places for recycling
houzixuandawang
- 练习链表的使用与操作的猴子选大王程序，以反复建立链表的方式有效解决了有意思的数学问题-practicing the use and operation of the monkey king election procedures Listless repeatedly to establish an effective way to solve an interesting mathematical problem
2006102411
- 猴子选大王，c语言，有源码，有注释，可供使用交流。-election monkey king, c language, the source code, notes, the availability of the exchange.
xyx
- 这是数据结构的应用 有小游戏的开发和计算 如猴子选大王 纸牌 文本统计等-This is the data structure of a small game development, and if the calculation monkey king playing card version of the election statistics
猴子选大王
- 算法，猴子选大王-algorithm, a monkey king election
猴子选大王的问题键表C
- 一个用C写的猴子选大王问题，是用键表实现的，拿出来和大家讨论一下-a monkey was elected king of the problem by using keys table to achieve, and we like to talk about
猴子选大王的问题键表C2
- 又一个用C语言编写的猴子先大王的问题，也是用键表写的这个简单一点。-also a C language prepared by the first king of the monkeys, as well as bonding with the written form of this simple point.
猴子选大王
- 关于猴子选大王的，运用了链表等功能建立一个不带头结点的单链表 利用单链表循环
code
- 1、猴子选大王 2、约瑟夫环 3、迷宫求解 4、回文游戏 5、地图四染色问题 6、八皇后问题 7、原四则表达式求值 8、k阶斐波那契序列 9、遍历二叉树 10、编写DFS算法的非递归函数。 编写BFS算法。 11、简单选择排序， 折半插入排序， 冒泡排序， 快速排序， 堆排序 12、顺序查找，折半查找-err
shujujiegou126
- 数据结构课程设计报告（纸牌游戏、猴子选大王、文章编辑）-Curriculum design data structure report (card games, elected king of the monkeys, the article editor)
cshrapdevelop
- 囊括了sharp诸多技术，例如一些常见算法，八皇后问题，猴子选大王问题，字符及字符串处理技术数据校验、控件数据处理’图片数据处理’日期和时间‘windows控件-Include a sharp many techniques, such as some of the common algorithm, the eight queens problem, the monkey king election issues, character and string processing data va
5.1monkey
- 猴子选大王，一个很简单的结构链表用法，简单实用(Monkey King, a very simple structure linked list usage, simple and practical)
15349069_卢健圳_猴子选大王解题报告V1
- c++数据结构，链栈入门，经典问题猴子选大王解题思路(C++ data structure, the introduction of chain stack)
猴子选大王
- 猴子选大王，有N只猴子，从1～N进行编号。它们按照编号的顺时针方向，排成一个圆圈，然后从第一只猴子开始报数。第一只猴子报1，以后每只猴子报的数字都是它前面猴子所报数字加1。如果一只猴子报的数字是M，则该猴子出列，下一只猴子重新从1开始报数。剩下的猴子继续排成一个圆圈报数，直到全部的猴子都出列为止。最后一个出列的猴子胜出。按照上述规则，编写程序选出排成一圈的猴子中的大王。(Monkey King, N monkeys, numbered from 1 to N. They are in accor
新建文件夹
- 猴子选大王，一堆猴子都有编号，编号是1，2，3 ...m ,这群猴子（m个）按照1--m的顺序围坐一圈，从第1开始数，每数到第N个，该猴子就要离开此圈，这样依次下来，直到圈中只剩下最后一只猴子，则该猴子为大王。(A bunch of monkeys are numbered, the number is 1, 2, 3... M, this group of monkeys (m) 1--m in accordance with the order around a circle, from t
monkey
- 猴子选大王c++实现：n只猴子围坐成一个圈，按顺时针方向从1到n编号。然后从1号猴子开始沿顺时针方向从1开始报数，报到m的猴子出局，再从刚出局猴子的下一个位置重新开始报数，如此重复，直至剩下一个猴子，它就是大王。(N monkey sitting around in a circle, numbered from 1 to n clockwise.Then start from 1 monkeys along the clockwise direction starting from 1 cou
猴子选大王
- 猴子选大王游戏的c++编程实现，可以参考一下。(The code of monkeys choose the king's game)