refactor 48

fishercoder1534 · fishercoder1534 · commit 2fd36054d76a · 2020-01-08T09:48:39.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_48.java b/src/main/java/com/fishercoder/solutions/_48.java
@@ -15,6 +15,8 @@ public class _48 {
     /**Note: this is an n*n matrix, in other words, it's a square, this makes it easier as well.*/
 
     public static class Solution1 {
+        //Time: O(n^2)
+        //Space: O(1)
         public void rotate(int[][] matrix) {
             /**First swap the elements on the diagonal, then reverse each row:
              * 1, 2, 3                    1, 4, 7                      7, 4, 1
diff --git a/src/test/java/com/fishercoder/_48Test.java b/src/test/java/com/fishercoder/_48Test.java
@@ -37,4 +37,26 @@ public void test2() {
         solution2.rotate(matrix);
         CommonUtils.print2DIntArray(matrix);
     }
+
+    @Test
+    public void test3() {
+        matrix = new int[][]{
+                {1, 2, 3, 4},
+                {5, 6, 7, 8},
+                {9, 10, 11, 12},
+                {13, 14, 15, 16}
+        };
+        solution2.rotate(matrix);
+        CommonUtils.print2DIntArray(matrix);
+    }
+
+    @Test
+    public void test4() {
+        matrix = new int[][]{
+                {1, 2},
+                {3, 4}
+        };
+        solution1.rotate(matrix);
+        CommonUtils.print2DIntArray(matrix);
+    }
 }
