循环链表解决约瑟夫环问题

/**
 * 循环链表求解约瑟夫环问题
 **/
#include <iostream>
#include <cstdlib>
using namespace std;

/**
 * 数据结构
 **/
typedef struct DanamicList {
    int id;
    struct DanamicList* next;
} List;

/**
 * 创建循环链表
 **/
List* InitList(int numCount) {
    if(numCount <= 0) {
        cout << "Value is invalid!!!
";
        exit(-1);
    }
    List *head = head = new List;
    if(!head) {
        cout << "Alloc memory failed!!!
";
        exit(-1);
    }

    head->id = 1;
    List *pre = head;
    for(int index = 1; index < numCount; ++index) {
        List *temp = new List;
        if(!temp) {
            cout << "Alloc memory failed!!!
";
            exit(-1);
        }
        temp->id = index + 1;
        temp->next = NULL;
        pre->next = temp;
        pre = temp;
    }
    pre->next = head;

    return head;
}

/**
 * 求解约瑟夫环问题
 **/
void josephus(List* head, int number) {
    int count = 0, flag = 0;
    List *pre = head, *del = NULL;

    while(pre->next != head)
        pre = pre->next;
    do {
        ++count;
        if(number != count)
            pre = pre->next;
        else {
            count = 0;
            del = pre->next;
            cout << del->id << "	";
            pre->next = pre->next->next;
            if (pre != pre->next)
                delete del;
        }
        if(pre == pre->next)
            ++flag;
    } while(flag - (number + 1));             // 数学关系
    delete pre;
}

/**
 * 主函数
 **/
int main(void) {
    List *head = NULL;
    int totalPeople = 0, outNumber = 0;
    cout << "请输入总数和出队密码：";
    cin >> totalPeople;
    cin >> outNumber;

    head = InitList(totalPeople);             // 创建循环链表
    josephus(head, outNumber);                // 求解约瑟夫环

    return 0;
}