- Category:
- Data structs
- Tags:
-
[WORD]
- File Size:
- 68kb
- Update:
- 2017-08-21
- Downloads:
- 0 Times
- Uploaded by:
- 乔强强
Description: Problem solving:
With a circular linked list node don't take the lead to handle the problem of Joseph: first constitute a one-way circular linked list of n nodes, and then from the first k node from 1 began to count, count to m, the corresponding node is removed from the list.Then the next node from the deleted node continues to count from 1...And so on, until all the nodes are listed, the program ends.
To Search:
File list (Check if you may need any files):
1.joseph（约瑟夫）\2.不带头结点的循环链表.png
1.joseph（约瑟夫）\3.joseph代码buf解决方案.png
1.joseph（约瑟夫）\约瑟夫问题.doc
1.joseph（约瑟夫）
Download