约瑟夫环的Java实现 Joseph Central Java implementation-Joseph Central Java implementation

丢手帕问题，用循环队列实现，可以任意输入循环人数及开始的地方-Lost handkerchief problem, with the circular queue implementation, you can enter any number and the beginning of the cycle

约瑟夫问题：编号为1,2，...n的n个人围坐一圈，约定编号为k的人从1开始报数，数到m的那个人出列，它的下一位又从1报数，数到m的那个人又出列，知道最后所有人都出列，由此产生一个出队编号的序列-Joseph problem: numbered 1,2, ... n individuals sitting around a circle of n, k who agreed numbered starting 1 reported that the number, the number to