数据结构-线性表

#线性表

初始化线性表中加了int a[]和int n两个参数是为了遍历线性表做准备

//定义线性表,定义一个结构 
typedef struct Sqlist
{
	int data[MaxSize];
	int length;
	
 }sqlist;
 //初始化线性表
 int init_sqlist(sqlist *&L,int a[],int n)
 {
 	L=(sqlist *)malloc(sizeof(sqlist));//动态分配空间 
 	for(int i=0;i<n;i++)
 	{
 		L->data[i]=a[i];
	 }
 	
 	L->length=10;//初始化线性表长度为0; 
 	//printf("L is %d\n",L);
  } 
//销毁线性表
int Destroylist(sqlist *L)
{
	free(L);
 } 
 //判断是否为空表
 int Emptylist(sqlist *L)
 {
 	if(L->length==0)
	 {
 		printf("this is empty\n");
 		return 0;
	 }
	 else
	 {
	 	printf("this is not empty\n");
	 }
  } 
  
  //遍历线性表 
int show_list(sqlist *L)
{
	if(L->length==0)return 0;
	for(int i=0;i<L->length;i++){
	
		printf("%d",L->data[i]);
		
	}
	printf("\n");
}

/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int main(int argc, char** argv) {
	int a[10]={4,1,2,3,5,6,7,8,9,10};
	sqlist *L;
	//printf("L is %d\n",L);
	init_sqlist(L,a,10);
	//printf("L is %d\n",L);
	Emptylist(L);
	show_list(L);
	
}