约瑟夫（Josephus）环问题：编号为1,2,3,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值m，从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一人开始重新从1报数，如此下去，直到所有人全部出列为止。

建立n个人的单循环链表存储结构，运行结束后，输出依次出队的人的序号。（必须用链表）-Joseph (Josephus) Central question: numbered 1,2,3, ..., n n individuals clockwise direction around a circle, each holding a password (positive integer). An optional start a positive integer as the upper limit of the number m, from the first person to start a clockwise direction from the beginning of the order number, report m stop. M out of newspaper columns, his password as the new value of m, starting from the next person on his re-clockwise direction from one number off, and so on, until all the columns so far. N round robin to establish a personal list storage structure, after the end of the run, the output sequence number of people out of the team. (Must list)