（2）利用循环链表实现约瑟夫问题的求解。 约瑟夫问题如下：已知n个人（n≥1）围坐一圆桌周围，从1开始顺序编号。从序号为1的人开始报数，顺时针数到m的那个人出列。他的下一个人又从1开始报数，数到m的那个人又出列。依次规则重复下去，直到所有人全部出列。请问最后一个出列的人的编号-(2) the use of circular linked list to achieve problem solving Joseph. Joseph problem as follows: Given n individual (n≥1) sitting around a round table, in order　a start number. From the number of people began to count off 1, clockwise number to m the man out of the column. His next person and　1 Countin, count to m the man was out of the column. Turn rule is repeated until everyone all the columns. Will the last one out of the column number of people