顺序表动态分配（增加长度）

#include<stdio.h>
#include<stdlib.h>
#define InitSize 5

typedef struct {
	int* data;
	int length;
	int MaxSize;
}DynamicList;
//初始化
void InitList(DynamicList& L) {
	L.data = (int*)malloc(InitSize * sizeof(int));
	L.MaxSize = InitSize;
	L.length = 0;
}
//增加长度
void IncreaseSize(DynamicList& 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);
}
void WriteOne(DynamicList& L, int num) {
	for (int i = 0; i < num; i++) {
		L.data[i] = i;
		L.length++;
	}
}
void WriteTwo(DynamicList& L, int num) {
	int start = L.length;
	for (int i = L.length; i < (start+num); i++) {
		L.data[i] = i+5;
		L.length++;
	}
}
void print(DynamicList L) {
	for (int i = 0; i < L.length; i++) {
		printf("serial number %d content %d\n", i, L.data[i]);
	}
}
int main() {
	DynamicList L;
	InitList(L);
	WriteOne(L,4);
	printf("Before increasing the length\n");
	print(L);
	IncreaseSize(L, 5);
	printf("After increasing the length\n");
	WriteTwo(L, 4);
	print(L);
	printf("MaxSize is %d\n", L.MaxSize);
	printf("length is %d", L.length);
	return 0;
}