顺序表

#include<iostream>
#include<cstdlib>
#define Maxsize 100
using namespace std;
typedef struct//存储元素 
{int data[Maxsize];int length; 
}Sqlist; 
//建立顺序表
typedef int CYDGOOD;
//初始化线性表
void InitList(Sqlist *& L)
{L = new Sqlist;L ->length = 0;} 
void CreateList(Sqlist *&L,CYDGOOD a[],int n)
{int i = 0,k = 0;L = new Sqlist;while(i < n){L ->data[k] = a[i];k++;i++;}L ->length = k;
}
//演示，添加主函数
int main()
{Sqlist *L;int a[] = {1,2,3,4,5};int n = sizeof(a) / sizeof(a[0]);CreateList(L,a,n);for(int i = 0;i < L->length;i++){cout << L->data[i] << "";}cout << endl;delete L;return 0;}