搜索资源列表
Yosefu
- 用环形链表解决的约瑟夫问题，其实不难，本人能力实在有限，做出这个已经差不多到极限了，请不要删除，谢谢！-Ring tree to Joseph, in fact, it is not difficult, I capacity is limited, This has been made almost to the limit, please do not delete, thank you!
huanxing
- 这是一个环形链表的实现程序，可以帮助大家更进步学习数据结构
A0_001 链表编程
- N只猴子要选大王,所有猴子按1,2,3...M报数，凡报到M的退出圈外,如此循环,直到圈内只剩一只,就是大王了. 分析:建立一个环形链表,每个猴子就是链表中的一个结点,那么猴子出圈就是对环形链表中的结点的删除,只到最后剩下的一个结点为止.-N monkeys to elect king, all the monkeys reported by a number 1,2,3 ... M, where M to report the withdrawal of outsiders, a
Array_String_GenList
- 数据结构中包括字符操作，环形链表的操作等，具有十分详细的编写过程-The data structure includes characters operation, circular linked list operation, has a very detailed process of preparing
cycleList
- 一个简易的环形链表程序，支持插入、查找、删除等基本操作，风格简约，gcc下编译通过-A simple circular linked list that supports insert, search, delete, and other basic operations, simple style, gcc compiler through
circlelist
- 环形链表实现，适合初学者自学使用，基于VS2013.-Ring linked list, suitable for beginners to learn, based on VS2013.
约瑟夫
- 使用c语言编程 解决acm中的约瑟夫问题（环形链表法）(C language programming to solve Joseph problem)