malloc的全称是memory allocation,中文叫动态内存分配,用于申请一块连续的指定大小的内存块区域以void*类型返回分配的内存区域地址,当无法知道内存具体位置的时候,想要绑定真正的内存空间,就需要用到动态的分配内存。
realloc原型是extern void *realloc(void *mem_address, unsigned int newsize);
#include<stdio.h>
#include <stdlib.h>
#define ERROR 0
#define OK 1
#define TRUE 1
#define FALSE 0
#define OVERFLOW -2
#define INFEASIBLE -1
#define LIST_INT_SIZE 100
#define LISTINCREMENT 10
typedef struct{
int *e;
int length;
int listsize;
}SqList;
int InitList(SqList *L){
L->e=(int *)malloc(LIST_INT_SIZE*sizeof(int));
if(!L->e) exit(OVERFLOW);
L->length=0;
L->listsize=LIST_INT_SIZE;
return OK;
}
int ListInsert(SqList *L,int i,int e){
if(i<1||i>L->length+1) return ERROR;
if(L->length>=L->listsize){
int *newbase=(int *)realloc(L->e,(L->listsize+LISTINCREMENT)*sizeof(int));
if(!newbase) exit(OVERFLOW);
L->e=newbase;
L->listsize += LISTINCREMENT;
}
int *q =&(L->e[i-1]);
int *p;
for(p=&(L->e[L->length-1]);p>=q;--p) *(p+1)=*p;
*q=e;
++L->length;
}
int deleteList(SqList *L,int i,int *e){
if(i<1||i>L->length) return ERROR;
int *p=&(L->e[i-1]);
*e = *p;
int *q=L->e+L->length-1;
for(++p;p<=q;++p)
*(p-1)=*p;
--L->length;
return OK;
}
int visitList(SqList L){
int i;
for(i=0;i<L.length;i++)
printf("%d\t",L.e[i]);
printf("\n");
return OK;
}
int main(){
SqList L;
InitList(&L);
int i;
for(i=1;i<5;i++)
ListInsert(&L,i,i);
visitList(L);
deleteList(&L,2,&i);
printf("%d\n",i);
visitList(L);
return 0;
}