顺序表的实现——动态分配

#include <stdlib.h>
#define InitSize = 10;

typedef struct{
    int *data;
    int length;
    int maxSize;   
}SeqList;

void InitList(SeqList &L){
    L.data = (int*)malloc(InitSize * sizeof(int)); //malloc会返回一个指针，所以一定要和data的一样
    L.length = 0;
    L.maxSize = InitSize
}

void IncreaseSize(SeqList &L, int len){
    int *p = L.data;
    L.data = (int*)malloc((L.maxSize + len) * sizeof(int));
    for(int i = 0; i<L.length; i++)
    {
         L.data[i] = p[i];
    }
    L.maxSize = L.maxSize+ len;
    free(p);
}