listdelete_sq.cpp

《数据结构》所有相关程序的算法。有图、数组以及二叉数的问题。附有程序及结果。

//ListDelete_Sq.cpp
//Delete the NO.i Element of Sq_List and get the value

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

//#define LIST_INIT_LENGTH 10  //LIST_INIT_LENGTH is the Init_Define_Length of Sq_List
//int array[LIST_INIT_LENGTH]={5,8,12,18,25,30,37,46,51,89};
			    //array use to assign init value of SqList
#define ElemType int
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
typedef struct 
{	int *elem;
	int length;
	int listsize;
}SqList;

int InitList_Sq(SqList &L)                                    //InitList_Sq() function
{   //Inititial a Sq_List
	L.elem=(int *)malloc(LIST_INIT_SIZE *sizeof(int));
	if (!L.elem) return(0);
	L.length=0;
	L.listsize=LIST_INIT_SIZE;
	return(1);
}//end of InitList_Sq() function

void ListDelete_Sq(SqList &L,int i, int &e)            //ListDelete_Sq() function
{
   int *p,*q;
   if((i<1)||(i>L.length))
       { cout<<i<<" is OverFlow !"<<endl;
	 exit(0);
	}
   p=&(L.elem[i-1]);
   e=*p;
   q=L.elem+L.length-1;
   for (++p;p<=q;++p)
      *(p-1)=*p;
   --L.length;
   cout<<"Success to Delete Sq_list !"<<endl;
}//end of ListDelete_Sq() function

void main()                                             //main() function
{
   SqList L;
   int e;
   int i,j;
   //L.elem=array;
   //L.length=LIST_INIT_LENGTH;
   cout<<"ListDelete_Sq.cpp"<<endl<<"================="<<endl<<endl;
   
   InitList_Sq(L);
   cout<<"Please input the Length of Demo SqList L: <eg. 5> ";
   cin>>L.length;
   cout<<"Please input the data of Demo SqList L: <eg. {34,54,30,2,40,...}> "<<endl;
   for(j=0;j<L.length;j++)
     cin>>L.elem[j];
	 
   cout<<endl;
   cout<<"Success to create a SqList:"<<endl;
   cout<<"Please input the NO.i element of Sq_List to delete:  <eg. 3> ";
   cin>>i;
   ListDelete_Sq(L,i,e);
   cout<<"The SqList After Delete is:  ";
   for(j=0;j<L.length;j++)
      cout<<L.elem[j]<<"  ";
   cout<<endl<<"...OK...!"<<endl;
   getch();
}//end of main() function