報數離開佇列遊戲

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

typedef struct Node
{
	int data;
	struct Node *next;
}Node;
Node *createList(int total);
void Josephus(struct Node *p1, int total, int from, int count);

int main(int argc, char const *argv[])
{
	int total, from, count;//total總人數，from第一個報數的人 ， count出列者喊的數 
	struct Node *L=NULL;
	
	scanf("%d%d%d", &total, &from, &count);
	L = createList(total);
	Josephus(L, total, from, count); 
	
	return 0;
}

Node *createList(int total)
{
	struct Node *p=NULL, *head=NULL;
	int i;
	
	for(i=1; i<=total; i++)
	{
		struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));
		
		newNode->data = i;
		if(head == NULL)
		{
			head = newNode;
		}
		else
		{
			p->next = newNode;
		}
		p = newNode;
	}
	p->next = head;//迴圈連結串列 
	return head;
}

void Josephus(struct Node *p1, int total, int from, int count)
{
	int i;
	
	for(i=1; i<from; i++)
	{
		p1 = p1->next;//將指標定位到表示第一個報數的人的結點處 
	}
	struct Node *p2=NULL;
	//迴圈的刪除佇列中報數到count的結點
	while(p1->next != p1)//只剩首位相連的最後一個節點時結束 
	{
		for(i=1; i<count; i++)
		{
			p2 = p1;
			p1 = p1->next;//p1定位出出列者結點p2為其前一個結點 
		}
		p2->next = p1->next;
		printf("Delete number: %d\n", p1->data);
		free(p1);
		p1 = p2->next;//恢復p1不斷指向新節點的功能 
		
	}
	printf("The last one is NO.%d\n", p1->data);
}