nsarray 释放_数组内存的释放与申请

参考链接:https://www.cnblogs.com/usec/p/7413829.html

使用二维数组的时候,有时候事先并不知道数组的大小,因此就需要动态的申请内存。常见的申请内存的方法有两种:malloc/free 和 new/delete。

一、malloc/free

(1)申请一维数组

48304ba5e6f9fe08f3fa1abda7d326ab.png

void dynamicCreate1Array()

{

int m;

int i;

int *p;

cout<

cin >> m;

p = (int*)malloc(sizeof(int)*m);//动态开辟

cout << "please input data" << endl;

for (i = 0; i < m; i++)

cin >> p[i];

cout << "data is :";

for (i = 0; i < m; i++)

cout << p[i] << endl;

free(p);

}

48304ba5e6f9fe08f3fa1abda7d326ab.png

(2)申请二维数组

48304ba5e6f9fe08f3fa1abda7d326ab.png

void dynamicCreate2Array()

{

int m, n;

int i, j;

int **p;

printf("please input the row and col:");

cin >> m >> n;

//scanf("%d%d", &m, &n);

p = (int**)malloc(sizeof(int*)*m); //开辟行

for (i = 0; i < m; i++)

{

*(p + i) = (int*)malloc(sizeof(int)*n);//开辟列

}

//输入数据

printf("please input data:");

for (i = 0; i < m; i++)

for (j = 0; j < n; j++)

cin >> p[i][j];

//输出数据

for (i = 0; i < m; i++)

{

for (j = 0; j < n; j++)

{

cout << p[i][j];

}

cout << endl;

}

//释放开辟的二维空间

for (i = 0; i < m; i++)

free(*(p + i));

}

48304ba5e6f9fe08f3fa1abda7d326ab.png

二、new/delete

(1)申请一维数组

48304ba5e6f9fe08f3fa1abda7d326ab.png

void DynamicCreate1Array()

{

int len;

int i;

cout << "please input the length of data: ";

cin >> len;

int *p = new int[len];

cout << "please input data: ";

for (int i = 0; i < len; i++)

cin >> p[i];

cout << "data is " << endl;

for (i = 0; i < len; i++)

cout <

delete[] p;

}

48304ba5e6f9fe08f3fa1abda7d326ab.png

(2)申请二维数组

48304ba5e6f9fe08f3fa1abda7d326ab.png

void DynamicCreate2Array()

{

int m, n;

int i;

cout << "input row and col: ";

cin >> m >> n;

//动态开辟空间

int **p = new int*[m]; //开辟行

for (int i = 0; i < m; i++)

p[i] = new int[n]; //开辟列

cout << "input data: ";

for (i = 0; i < m; i++)

for (int j = 0; j < n; j++)

cin >> p[i][j];

cout << "output: " << endl;

for (i = 0; i < m; i++)

{

for (int j = 0; j < n; j++)

cout << p[i][j]<

cout << endl;

}

//释放开辟的资源

for (i = 0; i < m; i++)

delete[] p[i];

delete[] p;

}

48304ba5e6f9fe08f3fa1abda7d326ab.png

注:另一种方法:

row:行

col:列

unsigned int **ppPathes;

*ppPathes = (unsigned int *)calloc(row * col, sizeof(unsigned int));

使用malloc:

*ppPathes = (unsigned int *)malloc(sizeof(unsigned int )*(PathNumTemp) * (pathLenTemp + 1));

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值