数据结构——顺序表的创建及功能函数

//SqList.h
#ifndef _SQ_LIST_
#define _SQ_LIST_

#define MAX 100

typedef struct _LinerList {
	int data[MAX];
	int length;
}SqList;

#endif // !_SQ_LIST_

//SqList_OP.h
#ifndef _SQ_LIST_OP_
#define _SQ_LIST_OP_

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

void Init_List(SqList *L) {	//初始化
	L->length = 0;
}

void Prt_List(SqList *L) {	//打印
	int count = 0;
	printf("The list is:\n");
	for (count = 0; count < (L->length - 1); count++) {
		printf("%d\n", L->data[count]);
	}
}

void Crt_List(SqList *L) {	//创建，录入数据
	int num = 0;
	int i = 0;
	do {
		printf("input number\n");
		scanf("%d", &num);
		L->data[i] = num;
		i++;
	} while (num != -1);
	L->length = i;//完成输入,此时的长度为录入了-1的总长度
}

void Destroy_List(SqList *L) {	//销毁
	free(L);
}

int List_Length(SqList *L) {	//求顺序表