add one more solution for 566

fishercoder1534 · fishercoder1534 · commit 7937b870552a · 2021-07-05T09:30:51.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_566.java b/src/main/java/com/fishercoder/solutions/_566.java
@@ -3,23 +3,41 @@
 public class _566 {
 
     public static class Solution1 {
-        public int[][] matrixReshape(int[][] nums, int r, int c) {
-            if (nums == null || nums.length == 0) {
-                return nums;
+        public int[][] matrixReshape(int[][] mat, int r, int c) {
+            if (mat == null || mat.length == 0) {
+                return mat;
             }
-            int m = nums.length;
-            int n = nums[0].length;
+            int m = mat.length;
+            int n = mat[0].length;
             if (r * c > m * n) {
-                return nums;
+                return mat;
             }
             int k = 0;
             int[][] result = new int[r][c];
             for (int i = 0; i < r; i++) {
                 for (int j = 0; j < c; j++, k++) {
-                    result[i][j] = nums[k / n][k % n];
+                    result[i][j] = mat[k / n][k % n];
                 }
             }
             return result;
         }
     }
+
+    public static class Solution2 {
+        public int[][] matrixReshape(int[][] mat, int r, int c) {
+            int m = mat.length;
+            int n = mat[0].length;
+            if (m * n != r * c) {
+                return mat;
+            }
+            int[][] reshapedMat = new int[r][c];
+            for (int i = 0; i < m; i++) {
+                for (int j = 0; j < n; j++) {
+                    int index = i * n + j;
+                    reshapedMat[index / c][index % c] = mat[i][j];
+                }
+            }
+            return reshapedMat;
+        }
+    }
 }
