refactor 48

fishercoder1534 · fishercoder1534 · commit 2ee3708a32be · 2020-01-09T09:44:50.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_48.java b/src/main/java/com/fishercoder/solutions/_48.java
@@ -80,4 +80,28 @@ public void rotate(int[][] matrix) {
         }
     }
 
+    public static class Solution3 {
+        public void rotate(int[][] matrix) {
+            int n = matrix.length;
+            for (int i = 0; i < n / 2; i++) {
+                for (int j = i; j < n - i - 1; j++) {
+                    //save the top
+                    int top = matrix[i][j];
+
+                    //move left to top
+                    matrix[i][j] = matrix[n - 1 - j][i];
+
+                    //move bottom to left
+                    matrix[n - 1 - j][i] = matrix[n - i - 1][n - 1 - j];
+
+                    //move right to bottom
+                    matrix[n - i - 1][n - 1 - j] = matrix[j][n - i - 1];
+
+                    //move top to right
+                    matrix[j][n - i - 1] = top;
+                }
+            }
+        }
+    }
+
 }
diff --git a/src/test/java/com/fishercoder/_48Test.java b/src/test/java/com/fishercoder/_48Test.java
@@ -8,12 +8,14 @@
 public class _48Test {
     private static _48.Solution1 solution1;
     private static _48.Solution2 solution2;
+    private static _48.Solution3 solution3;
     private static int[][] matrix;
 
     @BeforeClass
     public static void setup() {
         solution1 = new _48.Solution1();
         solution2 = new _48.Solution2();
+        solution3 = new _48.Solution3();
     }
 
     @Test
@@ -59,4 +61,16 @@ public void test4() {
         solution1.rotate(matrix);
         CommonUtils.print2DIntArray(matrix);
     }
+
+    @Test
+    public void test5() {
+        matrix = new int[][]{
+                {1, 2, 3, 4},
+                {5, 6, 7, 8},
+                {9, 10, 11, 12},
+                {13, 14, 15, 16}
+        };
+        solution3.rotate(matrix);
+        CommonUtils.print2DIntArray(matrix);
+    }
 }
