链表学习之猴子选大王

#include <stdio.h>
#include <malloc.h>
int size = 6;//猴子的数量，方便更改和使用;
typedef struct link_type
{
	int id;
	struct link_type* next;
}monkey;

monkey* Create(int size)
{
	monkey *p = NULL, *root = NULL, *tmp = NULL;
	printf("创建猴子的编号\n");
	int x;
	for (int i = 0; i < size; i++)
	{
		scanf_s("%d", &x);
		if (i == 0)
		{
			p = root = (monkey*)malloc(sizeof(monkey));
			p->id = x;
			p->next = NULL;
		}
		else
		{
			tmp = (monkey*)malloc(sizeof(monkey));
			tmp->id = x;
			p->next = tmp;
			p = p->next;
		}
	}
	p->next = root;
	return root;
}

void DeleteOneMonkey(monkey *m)//猴子出圈函数
{
	monkey *tmp = m, *t = m;
	while (tmp->next->id != m->id)
	{
		tmp = tmp->next;
	}
	tmp->next = m->next;
	free(t);
	size--;
}

monkey* FSP(monkey *p, int s)	//找到一开始数数的猴子
{
	int j = 1;
	while (j<s)
	{
		p = p->next;
		j++;
	}
	return p;
}

monkey *MonkeyCount(monkey*root, int i)//模拟猴子数数的函数，每回合猴子数i下
{
	monkey *tmp=NULL,*p=root;
	for (int k = 1; k < i; k++)
	{
		p = p->next;
	}
	tmp = p;
	return tmp;
}

void OutMonkey(monkey *root, int s, int i)//s:start 从s号猴子开始
{										  //i:数i下出一个猴子
	monkey *p, *tmp;					  //操作是删除一个链表结点
	p = tmp = root;
	p=FSP(p, s);
	while (size>1)
	{
		tmp = p = MonkeyCount(p, i);
		p = p->next;
		DeleteOneMonkey(tmp);//出错在用了delete而自己写的是Delete
	}						 //改名了
	printf("最后剩下的是%d号猴子\n",p->id);
}

int main(void)
{
	monkey *root;
	root = Create(size);
	OutMonkey(root, 1, 2);
	return 0;
}