循环双链表-删除元素

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

typedef int ElemType;
typedef struct LDNode{
	ElemType data;
	struct LDNode *next;
	struct LDNode *prior;
}LDNode,*DLinkList;

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

//循环双链表-删除第i位置上的元素,并用x保存
bool deleteElem(DLinkList &L,int i,ElemType &x)
{
	LDNode *pnext,*p=L;
	int j=0;
	while(p->next!=L&&j<i-1)
	{
		p = p->next;
		++j;
	}
	if(j==i-1)
	{
		pnext = p->next;
		p->next = pnext->next;
		x = pnext->data;
		p->next->next->prior = p;
		free(pnext);
		return true;
	}
	else
		return false;
}

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

void main()
{
	DLinkList L;
	ElemType x;
	insertTailElem(L);
	printList(L);
	deleteElem(L,2,x);
	printf("删除第2位元素:\n");
	printList(L);
	printf("x = %d\n",x);
}