add 2022

fishercoder1534 · fishercoder1534 · commit ff1cfb84d4f9 · 2021-10-02T09:49:59.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2022|[Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2022.java) ||Easy||
 |2018|[Check if Word Can Be Placed In Crossword](https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2018.java) ||Medium||
 |2017|[Grid Game](https://leetcode.com/problems/grid-game/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2017.java) ||Medium|Array, Matrix, Prefix Sum|
 |2016|[Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2016.java) ||Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_2022.java b/src/main/java/com/fishercoder/solutions/_2022.java
@@ -0,0 +1,20 @@
+package com.fishercoder.solutions;
+
+public class _2022 {
+    public static class Solution1 {
+        public int[][] construct2DArray(int[] original, int m, int n) {
+            int size = original.length;
+            if (m * n != size) {
+                return new int[][]{};
+            }
+            int[][] ans = new int[m][n];
+            int k = 0;
+            for (int i = 0; i < m; i++) {
+                for (int j = 0; j < n; j++) {
+                    ans[i][j] = original[k++];
+                }
+            }
+            return ans;
+        }
+    }
+}
