【编程题】约瑟夫环问题

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/houzijushi/article/details/82115617

【编程题】约瑟夫环问题

代码1，非递归

class Solution {
public:
    int LastRemaining_Solution(int n, int m)
    {
        if(n==0) return -1;
        int s=0;
        for(int i=2;i<=n;i++){
            s=(s+m)%i;
        }
        return s;
    }
};

代码2，递归

class Solution {
public:
    int LastRemaining_Solution(unsigned int n, unsigned int m)
    {
        if(n==0)
            return -1;
        if(n==1)
            return 0;
        else
            return (LastRemaining_Solution(n-1,m)+m)%n;
    }
};