All 15 Arrays & Multidimensional Arrays questions
More in Arrays & Multidimensional Arrays
How do you declare, initialize, and access elements of a one-dimensional array in Java? How do you declare and initialize an array of objects (reference types) versus an array of primitives, and what is the key difference in their default values? What utility methods does java.util.Arrays provide for common array operations like sorting, searching, filling, and comparing? How do you convert between an array and a List (ArrayList) in both directions, and what pitfalls exist with Arrays.asList()? How does Java handle array bounds checking, and what exception is thrown when accessing an invalid index? How do you correctly iterate a 2D array using both traditional indexed for-loops and the enhanced for-each loop, and when is each approach preferable? What is array covariance's relationship to generic arrays, and why can't you directly create a generic array like new T[10] or new List<String>[10]? How would you flatten a 2D array into a 1D array, and conversely, reshape a 1D array into a 2D array? How does Java implement covariant array typing, and why is this considered a design flaw that can lead to runtime ArrayStoreException? How would you efficiently copy, resize, or merge large arrays in Java, and what are the performance trade-offs between System.arraycopy(), Arrays.copyOf(), and manual loops?
Advertisement
Back to results for “Arrays”
Java › Arrays & Multidimensional Arrays

How do multidimensional arrays work in Java, and how do they differ from truly rectangular arrays in languages like C?

Intermediate

Answer

Java doesn't have true multidimensional arrays in the C sense; a 2D array (int[][]) is actually an array of arrays, where each row is an independently allocated one-dimensional array object -- this means rows can have different lengths (a "jagged" array), unlike a genuinely rectangular structure, and each row must be individually instantiated or accessed via nested indexing, with memory layout reflecting this array-of-arrays structure rather than one contiguous rectangular block.
int[][] matrix = new int[3][4];  // 3 rows, each with 4 columns (rectangular)
matrix[1][2] = 99;

int[][] jagged = new int[3][];  // 3 rows, columns not yet specified
jagged[0] = new int[2];
jagged[1] = new int[5];  // different length than row 0 -- legal, since it's an array of arrays
jagged[2] = new int[1];
Real-world example A program modeling a triangular data structure (like Pascal's triangle, where each row has one more element than the previous) uses a jagged array where each row is deliberately allocated with a different length, taking advantage of Java arrays not being required to be rectangular.

Common follow-ups: How would you iterate a jagged array safely without an IndexOutOfBoundsException from assuming uniform row length?;What's the memory/performance implication of the array-of-arrays structure versus a true contiguous 2D block?

Java Fundamentals: Syntax Data Types & Operators;Generics
All 15 Arrays & Multidimensional Arrays questions