循环链表 c语言小试牛刀

#include 
#include 


typedef struct node {
    int data;
    struct node *next;
}persen;

persen *initial(int n) {
    //创建一个头结点
    persen *p = (persen*)malloc(sizeof(persen));
    //创建一个临时结点
    persen *temp = p;
    p->data = 1;
    p->next = NULL;
    for (int i = 2; i <= n; i++) {
        persen *c = (persen*)malloc(sizeof(persen));
        c->data = i;
        c->next = NULL;
        temp->next = c;
        temp = temp->next;
    }
    temp->next = p;   //头尾相接
    return p;
}

void findAndkill(persen *head, int k, int m) {
    persen *tail = head;  //创建一个临时点
    //找到第一个结点的上一个结点
    while (tail->next != head)
    {
        tail = tail->next;
    }

    //找到编码为K的人
    persen *p = head;
    while (p->data != k) {
        tail = p;
        p = p->next;  //这里的tail与P之间正好差了一个
    }
    //从K开始数数
    while (p->next!=p) {
        for (int i = 1; i < m; i++) {
            tail = p;
            p = p->next;
        } //这里的tail与P之间正好差了一个
        tail->next = p->next;
        printf("出列人的编号为:%d\n", p->data);
        free(p);
        p = tail->next;
    }
    printf("出列人的编号为:%d", p->data);
    free(p);
    putchar('\n');
}

int main() {
    printf("圆桌人数：");
    int n;
    scanf("%d", &n);
    persen *p = initial(n);
    printf("从几号开始报数(1~%d)：", n);
    int k;
    scanf("%d", &k);
    printf("选择报到多少编号的桌子出列(1~%d)：", n);
    int m;
    scanf("%d", &m);
    findAndkill(p, k, m);
    return 0;
}