内存未被完全破坏-内存泄漏

我在代码中使用2D数组，我想在使用fun之前和使用它之后，由应用程序使用相同数量的内存。但不幸的是，这些价值观并不相同。当我检查fun开始时使用的内存(从代码-使用/proc/self/statm，其中操作系统是linux)，它是一些数量，当我检查fun函数中return ...之前使用的内存时，它与以前的数量不一样。您能看到一些内存泄漏吗?我认为所有的记忆在不必要的时候都在破坏，但也许有什么问题:actualVertices = newVertices;。你觉得呢?

编辑:第一次检查——在创建Independentsets之后，第二次检查在返回之前，所以Independentsets不是问题。除此之外，在Main中删除了Independentsets。acrualvertices和newVertices在内存中存在问题

编辑2:也许像这样检查内存:

double getUsedMemory()
{
    int tSize = 0, resident = 0, share = 0;
    ifstream buffer("/proc/self/statm");
    buffer >> tSize >> resident >> share;
    buffer.close();
    return  (double)(resident - share) / ToMBfromB * sysconf(_SC_PAGE_SIZE);
}

有问题吗?你知道更好的方法来编程内存统计吗?

int** CreateVertices(int row, int col) // Creating 2D array
{
    int** nVertices = new int*[row];
    for (int i = 0; i < row; ++i)
        nVertices[i] = new int[col]();
    return nVertices;
}
void DeleteVertices(int** tab, int rowCount) // Detroying 2D array
{
    for (int i = 0; i < rowCount; ++i)
        delete[] tab[i];
    delete[] tab;
}
int* fun(..., int n)
{
    int* independentSets;
    int** actualVertices;
    int** newVertices;
    int actualVerticesRowCount = n;
    int actualVerticesColCount = 1;
    independentSets = new int[1 << n] ();
    // first memory checking 
    actualVertices = CreateVertices(n, 1);
    for (int i = 0; i < n; ++i)
    {
        independentSets[1 << i] = 1;
        actualVertices[i][0] = i;
    }
    for (int el = 1; el < n; el++)
    {
        int col = el + 1;
        int row = Combination_n_of_k(n, col);
        newVertices = CreateVertices(row, col);
        int l = 0;
        for (int i = 0; i < actualVerticesRowCount; ++i)
        {
            // some computations...
            for (int j = actualVertices[i][actualVerticesColCount - 1] + 1; j < n; ++j)
            {   
                // some computations...
                for (int k = 0; k < el; ++k)
                    newVertices[l][k] = actualVertices[i][k];
                newVertices[l][el] = j;
                l++;
            }
        }
        DeleteVertices(actualVertices, actualVerticesRowCount);
        if (el != n - 1)
            actualVertices = newVertices;
        actualVerticesRowCount = row;
        actualVerticesColCount = col;
    }
    DeleteVertices(newVertices, actualVerticesRowCount);
    // second memory checking 
    return independentSets;
}