栈申请与堆申请
#include "stdafx.h"
#include <stdlib.h>
int _tmain(int argc, _TCHAR* argv[])
{
#if 0
//栈申请
int a; int *pa = &a;
*pa = 100;
printf("a = %d\n", a);
//堆申请
int *p = (int *)malloc(sizeof(int));
*p = 200;
printf("*p = %d\n", *p);
free(p);
//int a[1024*1024];
//int * p = (int*)malloc(1024*1024*1024);
//if(p == NULL) //通过返回值来进行判断是否成功申请
//{
// printf("malloc error\n");
//}
int array[100]; int *pa = array; //栈
int *p = (int*)malloc(sizeof(int)*100); //堆
for(int i=0; i<100; i++)
{
p[i] = 100;
printf("%d\n",p[i]);
}
free(p);
#endif
//calloc(对malloc的包装)适合申请数组
int *p = (int*)calloc(100, sizeof(int));
for (int i = 0; i<100; i++)
{
//自动给初始化为0
printf("%d\n", p[i]);
}
free(p);
//realloc 用于扩容原有内存的大小
//返回的地址有可能和原来的地址不相同
//因为原地址后面空间大小如果不够,需要另开辟一处空间
//来存储原有数据和扩容数据,返回的地址为新地址
return 0;
}