key02_5.cpp

该包是数据结构的实验软件,来源于合肥工业大学人工智能与数据挖掘实验室,用来实现数据结构.

// test02_5
#include "linklist.h"


link get(link l,int i)
{
	link P;
	int j;
	j=0;
	P=l;
	while ((j!=i) && (P!=NULL)){
		j=j+1;
		P=P->next;
	}
	return P;
}

void linkinsert(link &L,int i,int x)
{
	link P,S;
	P=get(L,i-1);
	if (P==NULL) Error("Overflow when insert in L");
	else{
		S=(link)malloc(sizeof(struct node));
		S->data=x;
		S->next=P->next; 
		P->next=S;
	}
}

void linkdelete(link &L,int i)
{
	link P,U;
	P=get(L,i-1);
	if ((P==NULL) || (P->next==NULL)) Error("Overflow when delete in L");
	else{
		U=P->next;
		P->next=U->next; 
		free(U);
	}
}

void disab(link &A,link &B)
{
	link P,U,R;
	B=(link)malloc(sizeof(struct node));
	R=B;
	P=A->next;
	while ( (P!=NULL) && (P->next!=NULL)){
		U=P->next;
		P->next=U->next;
		R->next=U; 
		R=U;
                P=P->next;
	}
	R->next=NULL;
}

void main()
{
	link L,L1;
	get_hsllist(L);
	linkinsert(L,3,100);
	display_hsllist("insert 3,100",L);
	Wait();
	linkdelete(L,5);
	display_hsllist("delete 5",L);
	Wait();
	Clear_range(1,1,getmaxx(),getmaxy());
	comput_sllist_card(L,50,100);
	disp_hsllist("Old List",L);
	Wait();
	disab(L,L1);
	comput_sllist_card(L,50,250);
	disp_hsllist("Odd List",L);
	Wait();
	comput_sllist_card(L1,50,400);
	disp_hsllist("Even List",L1);
	Wait();
}