顺序表实现——动态分配

#include<bits/stdc++.h>
#define InitSize 10//默认长度
using namespace std;typedef struct{int *data;//动态分配数组指针int MaxSize;//顺序表最大容量int length;//顺序表当前长度
}SeqList;void InitList(SeqList &L){L.data=(int*)malloc(InitSize*sizeof(int));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);
}int main()
{SeqList L;InitList(L);IncreaseSize(L,5);return 0;
}