搜索资源列表
Josephus_CircList
- 用循环链表求解约瑟夫问题，采用C++语言，内含详细注释，个人认为用数据结构方式解决约瑟夫问题比采用数组更容易理解-Joseph solving the problem with the circulation list, using C++ language, containing detailed comments, personally think that the data structure used to resolve the problem Joseph easier to und
Josephproblems
- 通过循环链表结构来实现约瑟夫问题也可以有更多的应用-Achieved through the linked list structure of Joseph problems can have more applications
Josephus
- 约瑟夫问题，这是用VC环境实现的一个数据结构经典问题-Joseph, and this is a VC environment data structure to achieve the classic problem
Jorseve
- 用于解决约瑟夫问题。堆栈方法。约瑟夫问题是个有名的问题：N个人围成一圈，从第一个开始报数，第M个将被杀掉，最后剩下一个，其余人都将被杀掉。例如N=6，M=5，被杀掉的人的序号为5，4，6，2，3。最后剩下1号。 -Joseph used to solve the problem. Stack method. Josephus problem is a well-known problem: N individual circle, starting from the first report n
Joseph
- 有关著名的约瑟夫问题，用了三种方法，链表，公式化描述和虚拟指针-Joseph, the well-known problem, with the three methods, lists, descr iptions and virtual pointer formulaic
Josephus
- 约瑟夫问题的循环链表求解，可以输出每一步的结果-Joseph circular linked list problem solving, can output the results of each step
cpp_joseph_8queen
- 约瑟夫问题 八皇后问题 冒泡排序法，都在里面了-Problem eight queens problem Joseph bubble sort method, in which the
DoubleLinkSoveJoseph
- 双向循环链表解决约瑟夫问题，并有教程 密码可以为正数（顺时针转），密码也可以为负数（逆时针转）。-Joseph-way circular linked list to solve the problem, and tutorials password can be positive (clockwise), the password can also be negative (CCW).
yuesefu
- 约瑟夫问题代码,简短的代码书写。详细的代码注释，可以一看便清楚-yusefuwenti
Joseph
- 约瑟夫问题 用C循环编写的源程序代码 希望对有些人有些用-Issues written by Joseph C cycle
ChooseKing
- 约瑟夫问题，也即猴子选大王的问题。采用循环链表来实现。-Josephus problem, namely the problem of the monkey king election. Achieved using circular linked list.
Joseph
- 解决约瑟夫问题,一圈人围在圆桌上，报数，从某人开始数数，数到4（举例）则该人被淘汰，剩下的人继续，直到全部被淘汰，依次输出淘汰顺序-solve Joseph problems: one for the original one, the other is for the new problem, they are similar,but they are not the same.
Josephus
- 此代码能够利用循环链表解决约瑟夫问题并且为c++代码-This code can solve the Josephus problem using circular linked list and for the c++ code
yuesefu
- 约瑟夫问题：一群猴围成一圈报数，每报道n，该猴离开，求最后余下猴-Joseph problems: report of a circle Qunhou number of reports each n, the monkeys away, seeking the last remaining monkeys
JosephusProblem
- 这是约瑟夫问题,用循环链表实现的,其代码用头文件写出-This is Joseph problems linked with the implementation cycle, the code is written with the header file
papa
- 约瑟夫问题，丢手帕问题，面试很重要的 根据老师上课的故事编写，希望对大家有帮助！-Joseph interview questions handkerchief very important issue
JosephProblems
- 用计算的方法实现约瑟夫问题，n个人围成一圈，从第s个开始报数，报到m出列，输出出列顺序-Achieved with the method of calculation Joseph problems, n personal circle, beginning from the first s report number, report m the column, the column order of the output
shujujiegou
- 分别用数组和链表解决数据结构中的约瑟夫问题，自己看看吧。-Arrays and linked lists were used to solve the problem of data structure of Joseph, his look.
Jusefo.c
- 约瑟夫问题(c语言) 有1至 N编号的N 个人按顺时针方向围坐一圈，每人持有一个密码（正整数），一开始以正整数m作为报数上限值，从第一个人开始顺时针方向自1开始顺序报数，报到m时停止报数，报m的人出列，将他的密码作为新的报数上限值，从他的顺时针方向上的下一个人开始重新报数，如此下去，直至所有的人全部出列为止，要求产生记录出列顺序的表。如N = 7，每个人的密码依次是：3，1，7，2，4，8，4，m的值为20，则出列顺序为6，1，4，7，2，3，5。所有人用一个循环单链表表示，表中每个结点代
Joseph
- 此程序是根据约瑟夫问题编写的一段代码，提供给数据结构课程的初学者作为参考-This procedure is based on Joseph to prepare a piece of code available to the data structure as a reference for beginners course