约瑟夫环，指针实现

约瑟夫环，指针实现

#include <iostream>
#include <stdio.h>
#include <stdlib.h>

using namespace std;

typedef struct Node
{
    int Id;
    struct Node * Next;
} NODE;

int main()
{

    int n, m;

    scanf("%d %d", &n, &m);

    NODE *head, *p, *q;
    head = (NODE *)malloc(sizeof(NODE));

    head->Id = 1;
    head->Next = NULL;

    q = head;
    for(int i=2; i<=n; i++)
    {
        p = (NODE*)malloc(sizeof(NODE));
        p->Id = i;
        p->Next = NULL;
        q->Next = p;
        q = q->Next;
    }
    q->Next = head;

    p = head;

    while(p!=p->Next)
    {
        for(int cnt=1; cnt<=m-1; cnt++)
        {
            q = p;
            p = p->Next;
        }
        q->Next = p->Next;
        //printf("%d ", p->Id);
        NODE* t = p;
        p = p->Next;
        free(t);
    }
    printf("%d
", p->Id);

    return 0;
}