循环单链表-删除元素

#include<stdio.h>
#include<stdlib.h>
typedef int ElemType;
typedef struct LNode {
	ElemType data;
	struct LNode *next;
}LNode,*LinkList;

LinkList listTailInsert(LinkList &L)
{
	ElemType x;
	LNode *s,*r;
	L = (LinkList)malloc(sizeof(LNode));
	r = L;
	scanf("%d",&x);
	while(x!=9999)
	{
		s = (LNode*)malloc(sizeof(LNode));
		s->data = x;
		r->next = s;
		r = s;
		scanf("%d",&x);
	}
	r->next = L;
	return L;
}

//循环单链表删除第i位元素，并存储到x中
bool deleteElem(LinkList &L,int i,ElemType &x)
{
	LNode *p = L;
	LNode *s;
	int j = 0;
	while(p && j<i-1)
	{
		p = p->next;
		++j;
	}
	if(p && j==i-1)
	{
		s = p->next;
		p->next = s->next;
		x = s->data;
		free(s);
		return true;
	}
	else
		return false;
}

void printList(LinkList L)
{
	LNode *p = L->next;
	while(p!=L)
	{
		printf("%d ",p->data);
		p = p->next;
	}
	printf("\n");
}

void main()
{
	LinkList L;
	ElemType x;
	listTailInsert(L);
	printList(L);
	printf("删除第2位元素，并将其保存到x中:\n");
	deleteElem(L,2,x);
	printList(L);
	printf("x = %d\n",x);
}