C语言/C++ 动态分配数组(一维/二维)的大小

c语言：malloc - free
c++：malloc - free and new - delete

代码(已通过编译)：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <deque>
#include <list>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <iterator>
using namespace std;

typedef long long ll;
const int inf = 0x3f3f3f3f;
const ll  INF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double E = exp(1.0);
const int MOD = 1e9+7;
const int MAX = 1e5+5;

int main()
{
    /*
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    */

    /** C语言/C++ */
    /*  一维数组：malloc - free
    int * p;
    int len = 10;// 数组长度
    p = (int *)malloc(len * sizeof(int));
    free(p);
    */

    /* 二维数组：
    int **p;
    int row = 3; int col = 3;
    p = (int **)malloc(row * sizeof(int*));
    for(int i = 0; i < row; i++)
    {
        p[i] = (int *)malloc(col * sizeof(int));
    }
    for(int i = 0; i < row; i++)
    {
        free(p[i]);
    }
    free(p);
    */

    /** C++ */
    /* 一维数组：new - delete
    int * p;
    int len = 10;
    p = new int[len];

    delete []p;
    */

    /* 二维数组：new - delete
    int ** p;
    int row = 3; int col = 3;
    p = new int*[row];
    for(int i = 0; i < row; i++)
    {
        p[i] = new int[col];
    }

    delete []p;
    */

    return 0;
}