solves convert 1d array to 2d array

Author: anishLearnsToCode

README.md

@@ -482,7 +482,7 @@
 | 2006 | [Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k)                        |                                                    [![Java](assets/java.png)](src/CountNumberOfPairsWithAbsoluteDifferenceK.java)                                                    |                                                                                                                                   |
 | 2011 | [Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations)                  |                                                  [![Java](assets/java.png)](src/FinalValueOfVariableAfterPerformingOperations.java)                                                  |                                                                                                                                   |
 | 2016 | [Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements)                            |                                                   [![Java](assets/java.png)](src/MaximumDifferenceBetweenIncreasingElements.java)                                                    |                                                                                                                                   |
-| 2022 | [Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array)                                                            |                                                                                                                                                                                      |                                                                                                                                   |
+| 2022 | [Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array)                                                            |                                                            [![Java](assets/java.png)](src/Convert1DArrayInto2DArray.java)                                                            |                                                                                                                                   |
 | 2027 | [Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string)                                                          |                                                                                                                                                                                      |                                                                                                                                   |
 | 2032 | [Two Out of Three](https://leetcode.com/problems/two-out-of-three)                                                                                        |                                                                                                                                                                                      |                                                                                                                                   |
 | 2037 | [Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone)                                        |                                                                                                                                                                                      |                                                                                                                                   |

src/Convert1DArrayInto2DArray.java

@@ -0,0 +1,16 @@
+// https://leetcode.com/problems/convert-1d-array-into-2d-array
+// T: O(n * m)
+// S: O(n * m)
+
+public class Convert1DArrayInto2DArray {
+    public int[][] construct2DArray(int[] original, int m, int n) {
+        if (m * n != original.length) return new int[0][];
+        final int[][] result = new int[m][n];
+        for (int i = 0 ; i < m ; i++) {
+            for (int j = 0 ; j < n ; j++) {
+                result[i][j] = original[n * i + j];
+            }
+        }
+        return result;
+    }
+}