约瑟夫环---单向循环链表

题目：实现一个围圈报数的小函数，7个人围一圈，从第1个人开始报数，报道3的人结束游戏，计算出最后剩下一个人的时候，他是第几个人。
代码：
默认从第一个人开始报数

#include<iostream>
using namespace std;
struct Lnode{
    int data;
    Lnode * next;
};
int Cyclecountoff(int people, int num){
    Lnode *head,* pnode, *prepnode=NULL, *curr = NULL;
    head = pnode = new Lnode;
    pnode->data = 1;
    pnode->next = pnode;
    curr = pnode;
    for (int i = 2; i <= people; i++){
        Lnode* tmp = new Lnode;
        tmp->data = i;
        tmp->next =curr->next;
        curr->next = tmp;
        curr = tmp;     
    }
    prepnode = curr;
    while (people--){
        for (int s = 1; s < num; s++){
            prepnode = pnode;
            pnode = pnode->next;
        }
        prepnode->next = pnode->next;
        printf("删除的第一个元素%d\n", pnode->data);
        pnode = prepnode->next;
    }
    return 0;
}
int main(){
    Cyclecountoff(7,3);
    system("pause");

}

设定从第N个人开始报数

#include<iostream>
using namespace std;
struct Lnode{
    int data;
    Lnode * next;
};
int Cyclecountoff(int people, int N, int num){
    Lnode *head,* pnode, *prepnode=NULL, *curr = NULL;
    head = pnode = new Lnode;
    pnode->data = 1;
    pnode->next = pnode;
    curr = pnode;
    for (int i = 2; i <= people; i++){
        Lnode* tmp = new Lnode;
        tmp->data = i;
        tmp->next =curr->next;
        curr->next = tmp;
        curr = tmp;     
    }
    prepnode = curr;
    for (int j = 1; j < N; j++){
        prepnode = pnode;
        pnode = pnode->next;
    }
    while (people--){
        for (int s = 1; s < num; s++){
            prepnode = pnode;
            pnode = pnode->next;
        }
        prepnode->next = pnode->next;
        printf("删除的第一个元素%d\n", pnode->data);
        pnode = prepnode->next;
    }
    return 0;
}
int main(){
    Cyclecountoff(7,2,3);
    system("pause");

}