顺序表--动态分配

顺序表的动态分配

#include<stdio.h>
#include<stdlib.h>
#define Initsize 10
typedef struct seqlist{
	int *data;
	int MaxSize;
	int length;
}Seqlist;
void InitList(Seqlist &l){ //初始化
	l.data = (int*)malloc(Initsize*sizeof(int)); //分配是个int型空间，相当于a[10];
	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);//释放中转的p；
}
int main(){
	Seqlist l;
	InitList(l);
	IncreaseSize(l,5);
	return 0;
}

静态的为

typedef struct seqlist{
	int data[10];
	int MaxSize;
	int length;
}Seqlist;