约瑟夫环

#include"stdio.h"
#include"stdlib.h"
struct node
{
int num;
struct node *next;
};

struct node *head = NULL;
struct node *last = NULL;
void create(int n)
{
struct node *p = (struct node *)malloc(sizeof(struct node));
if(head == NULL)
{
head = p;
p->num = n;
last = p;
last->next = head;
}
else
{
last->next = p;
p->num = n;
last = p;
last->next = head;
}
// printf("%d %d\n",p->num,head->num);
}

void my_move(struct node *p)
{
struct node *q,*front;
q = head;
front = head;
if(p == head)
{
while(q->next != head)
{
q=q->next;
}
front = p;
q->next = p->next;
head = p->next;
free(front);
}
else
{
while(q!=p)
{
front =q;
q=q->next;
}
if(q->next ==head)
{
front->next = head;
free(q);
}
else
{
front->next = q->next;
free(q);
}
}
}


int main()
{
int n;
int i;
printf("please input the num\n");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
create(i);
}
printf("create success\n");
struct node *p = head;
while(n!=1)
{
struct node *q;
p = p->next->next;
q = p;
p = p->next;
my_move(q);
n--;
}
printf("the end staty is%d\n",p->num);
return 0;
}