利用循环链表实现约瑟夫问题的求解。

约瑟夫问题如下：已知n个人（n>=1）围坐一圆桌周围，从1开始顺序编号。从序号为1的人开始报数，顺时针数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规则重复下去，直到所有人全部出列。请问最后一个出列的人的编号。

-Circular linked list Joseph problem solving. Joseph questions are as follows: Given n individuals (n>　= 1) were sitting around a round table, numbered sequentially starting at 1. From the serial number off people 1 clockwise the number m of that person out of the line　his next and from one number off, the number m, the man was out of the line　and so the rule is repeated down until all all out of the line. Will the last out of the line number.