C ++中的多维数组和指针？

Question

int *x = new int[5]();

With the above mentality, how should the code be written for a 2-dimensional array - int[][] ?

int **x = new int[5][5] () //cannot convert from 'int (*)[5]' to 'int **'

In the first statement I can use:

x[0]= 1;

But the second is more complex and I could not figure it out. Should I use something like:

x[0][1] = 1;

Or, calculate the real position then get the value for the fourth row and column 1

x[4*5+1] = 1;

Answer 1

I prefer doing it this way:

int *i = new int[5*5];

and then I just index the array by 5 * row + col .

Answer 2

You can do the initializations separately:

int **x = new int*[5];
for(unsigned int i = 0; i < 5; i++)
    x[i] = new int[5];

Answer 3

There is no new[][] operator in C++. You will first have to allocate an array of pointers to int:

int **x = new int*[5];

Then iterate over that array. For each element, allocate an array of ints:

for (std::size_t i = 0; i < 5; ++i)
    x[i] = new int[5];

Of course, this means you will have to do the inverse when deallocating: delete[] each element, then delete[] the larger array as a whole.

Answer 4

This is how you do it:

int (*x)[5] = new int[7][5] ;

I made the two dimensions different so that you can see which one you have to use on the lhs.

Answer 5

Ff the array has predefined size you can write simply:

int x[5][5];

It compiles

If not why not to use a vector?

Answer 6

There are several ways to accomplish this:

• Using gcc's support for flat multidimensional arrays (TonyK's answer, the most relevant to the question IMO). Note that you must preserve the bounds in the array's type everywhere you use it (eg all the array sizes, except possibly the first one), and that includes functions that you call, because the produced code will assume a single array. The allocation of $ new int [7][5] $ causes a single array to be allocated in memory. indexed by the compiler (you can easily write a little program and print the addresses of the slots to convince yourself).

• Using arrays of pointers to arrays. The problem with that approach is having to allocate all the inner arrays manually (in loops).

• Some people will suggest using std::vector's of std::vectors, but this is inefficient, due to the memory allocation and copying that has to occur when the vectors resize.

• Boost has a more efficient version of vectors of vectors in its multi_array lib.

In any case, this question is better answered here: How do I use arrays in C++?