约瑟夫问题-循环链表典型应用
　　n 个人围成一个圆圈，首先第 1 个人从 1 开始一个人一个人顺时针报数，
　　报到第 m 个人，令其出列。然后再从下一 个人开始从 1 顺时针报数，报
　　到第 m 个人，再令其出列，…，如此下去，求出列顺序。

　　求解: 假设 m = 3, n = 8 (1 2 3 4 5 6 7 8)
　　结果: 3 6 1 5 2 8 4 7(Joseph problem - typical application of circular list
N people form a circle. First, the first person counts clockwise from 1,
Report to the m person and order him to be listed. Then start from the next person and report clockwise from 1
To the m person, and then make it out And so on, find the order of the columns.
Solution: assume M = 3, n = 8 (1 23 4 5 6 7 8)
Results: 3 61 52 8 4 7)