《剑指offer》45：约瑟夫问题

约瑟夫问题

这个问题太经典了，就是n个人围成一圈，编号依次为0,1,…,n-1，每m个人取一个人退出游戏，求最终剩下的人的编号是多少？

思路1：模拟

自己随便手写个循环链表来模拟（不过写得太丑啦）：

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

class Solution {
public:
    int LastRemaining_Solution(unsigned int n, unsigned int m) {
        if (n == 0 || m == 0)
            return -1;
        CycleList cList(n);
        ListNode* now = cList.head;
        while (cList.size > 1)
            now = cList.removeMthFromIt(now, m);
        return cList.head->val;
    }

private:
    struct ListNode
    {
        int val;
        ListNode* next;
        ListNode(int n)
        : val(n), next(NULL) {}
    };

    class CycleList {
    public:
        CycleList(unsigned int n) {
            head = new ListNode(0);
            size = n;

            ListNode* last = head;
            for (int i = 1; i < n; ++i) {
                ListNode* now = new ListNode(i);
                last->next = now;
                last = now;
            }
            last->next = head;
        }

        ListNode* removeMthFromIt(ListNode* from, int m) {
            ListNode* last = NULL;
            while (--m > 0) {
                last = from;
                from = from->next;
            }
            last->next = from->next;
            if (from == head)
                head = last;
            // cout << "remove " << from->val << endl;
            delete from;
            --size;
            return last->next;
        }

        ListNode* head;
        int size;
    };
};


int main() {
    cout << Solution().LastRemaining_Solution(5, 3) << endl;

    return 0;
}

思路2：用数学推导规律

这个，看书吧，不做搬运工了～