用链表解决的约瑟夫问题。约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。-Joseph with a list of problems to solve. Josephus is the application of a mathematical problem: Known n individuals (in number 1,2,3 ... n, respectively) sitting around a round table. From the number of people began to count off k, m number to the person out of the line　he s the next person and　1 Countin, count to m the man was out of the column　and so the law is repeated until the round table It was all out of the column.