数据结构-02-1 顺序表的定义

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

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

void InitList(SeqList& L) {
	//malloc 申请一片连续的存储空间
	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;
}