用于解决约瑟夫问题。堆栈方法。约瑟夫问题是个有名的问题：N个人围成一圈，从第一个开始报数，第M个将被杀掉，最后剩下一个，其余人都将被杀掉。例如N=6，M=5，被杀掉的人的序号为5，4，6，2，3。最后剩下1号。 -Joseph used to solve the problem. Stack method. Josephus problem is a well-known problem: N individual circle, starting from the first report number, the first M months will be killed, what is left one, the others will be killed. For example, N = 6, M = 5, number of people being killed as 5,4,6,2,3. The last remaining No. 1.