2.2.1线性表的顺序存储结构---顺序表

#include <iostream>
using namespace std;

#define MaxSize 50
typedef int ElemType;
typedef struct
{
    ElemType data[MaxSize];
    int length;
}Sqlist;

 1 #include <iostream>
 2 using namespace std;
 3 
 4 #define MaxSize 50
 5 typedef int ElemType;
 6 typedef struct
 7 {
 8     ElemType data[MaxSize];
 9     int length;
10 }Sqlist;
11 
12 //创建顺序表
13 void CreateList(Sqlist * &L, ElemType a[], int n)
14 {
15     int i = 0, k = 0;
16     L = (Sqlist *)malloc(sizeof(Sqlist));
17     while (i<n)
18     {
19         L->data[k] = a[i];
20         k++, i++;
21     }
22     L->length = k;
23 }
24 int main()
25 {
26     ElemType a[] = {1,3,5,7,9,12,89,100};
27     Sqlist * L = {};
28     CreateList(L, a, 5);
29     for (size_t i = 0; i < L->length; i++)
30     {
31         printf("%d\n", L->data[i]);
32     }
33     getchar();
34     return 0;
35 }