初学数据结构四

#include<stdio.h>
#include<stdlib.h>
struct _Node
{
int data;
struct _Node *next;
};
typedef struct _Node node_t;
typedef struct _Linklist
{
node_t *phead;
node_t *ptail;
int len;
}Linklist;
static node_t *GetNode(int i)
{
node_t *pNode;
pNode=(node_t*)malloc(sizeof(node_t));
if(!pNode)
{
prinf("Error, the memory is not enough!
");
exit(-1);
}
pNode->data=i;
pNode->next=NULL;
return pNode;
}
void init_list(Linklist *plist)
{
node_t *p;
p=GetNode(1);
plist->phead=p;
plist->ptail=p;
p->next=plist->phead;
plist->len=1;
}
static void Create_List(Linklist*plist,int n)
{
int i=0;
node_t *pNew;
for(i=2;i<=n;i++)
{
pNew=GetNode(i);
plist->tail->next=pNew;
plist->tail=pNew;
pNew->next=plist->phead;
plist->len++;
}
printf("Completethe e-way circulation chain table the");
}
void Print_List(Linklist* plist)
{
node_t *pCur=plist->head;
do
{
printf("THe %d person.
",plist->data);
pCur=pCur->next;
}while(pCur!=plist->phead);
printf("The length of the list:%d
",plist->len);
}
void joseph(Linklist *plist,int m)
{
node_t *pPre=plist->ptail;
node_t *pCur=plist->phead;
int i;
while(plist->len!=1)
{
i=0;
while(plist->len!=1)
{
i=0;
while(i<m-1)
{
pPre=pPre->next;
i++;
}
pCur=pPre->next;
pPre->next=pCur->next;
free(pCur);
plist->len--;
}
printf("The last one is:",pPre->data);
}
int main()
{
int n=0;
printf("Please input the length of the Circle list:");
scanf_s(%d,&m);
Linklist pList;
init_list(&pList);
Create_List(&pList,n);
Print_List(&pList);
joseph(&pList,m);
system("pause");
return 0;
}