n是依次1--n 循环报数,报到n的猴子去掉,m是猴子总数.
public int getQue(int n,int m){
int r = 0;
for(int i=2;i<=n;i++)
r = (r+m)%i;
return r+1;
}