算法：一群猴子排成一圈，循环淘汰第m个

今天看了一个题比较有意思，就用js完成了一下

需求：

一群猴子排成一圈，按1，2，…，n依次编号。然后从第1只开始数，数到第m只,把它踢出圈，从它后面再开始数，再数到第m只，在把它踢出去…，如此不停的进行下去，直到最后只剩下一只猴子为止，那只猴子就叫做大王。要求编程模拟此过程，输入m、n, 输出最后那个大王的编号。用程序模拟该过程

var n=30,m=6;
var arr = [];
//先追加n个成员
for (let i=1; i<=n; i++) {
    arr.push(i);
}
while (arr.length > 1) {
	//这里之所以是arr.length + m - 2 是需要arr减少到最少2个成员还能做最后一次互相报数
    for (let i =1; i<=arr.length + m - 2; i++) {
        let v = arr.shift();
        if (i % m != 0) {
            arr.push(v);
        }
    }
    console.log(arr);
}

[ 1, 2, 3, 4, 5, 8, 9, 10, 11, 13, 15, 16, 17, 19, 20, 22, 23, 25, 26, 27, 29 ]
[ 2, 3, 4, 5, 9, 10, 11, 13, 15, 17, 19, 20, 22, 23, 26, 27, 29, 1 ]
[ 3, 4, 5, 9, 11, 13, 15, 17, 19, 22, 23, 26, 27, 29, 2 ]
[ 5, 9, 11, 15, 17, 19, 22, 23, 27, 29, 2, 3, 4 ]
[ 11, 15, 17, 22, 23, 27, 29, 2, 4, 5, 9 ]
[ 17, 22, 23, 29, 2, 4, 5, 9, 15 ]
[ 29, 2, 5, 9, 15, 17, 22 ]
[ 9, 15, 22, 29, 2, 5 ]
[ 29, 2, 9, 15, 22 ]
[ 15, 22, 2, 9 ]
[ 9, 15, 2 ]
[ 9, 15 ]
[ 9 ]

最终答案：9

各位小伙伴如果还有更好的算法可以在下方评论！！！