2022_convert_1_d_array_into_2_d_array.java

// @lc app=leetcode id=2022 lang=java

class Solution {
    public int[][] construct2DArray(int[] original, int m, int n) {
        if (original.length != (m * n)) return new int[0][0];
        int[][] modified = new int[m][n];
        int counter = 0;
        for (int i = 0; i < m; i++)
            for (int j = 0; j < n; j++)
                modified[i][j] = original[counter++];
        return modified;
    }
}