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.

1.joseph（约瑟夫）\2.不带头结点的循环链表.png
1.joseph（约瑟夫）\3.joseph代码buf解决方案.png
1.joseph（约瑟夫）\约瑟夫问题.doc
1.joseph（约瑟夫）

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．