48. Rotate ImageCopy for MarkdownCopy for Markdown

coderbean · coderbean · commit b7ed0df716b3 · 2019-07-07T22:18:22.000+08:00
diff --git a/LeetCode-Java.iml b/LeetCode-Java.iml
diff --git a/README.md b/README.md
@@ -1 +1,3 @@
 # LeetCode-Java
+
+用 Java 刷刷 LeetCode， 保持思维活跃。
diff --git a/src/main/java/leetcode/_48_/Main.java b/src/main/java/leetcode/_48_/Main.java
@@ -0,0 +1,25 @@
+package leetcode._48_;
+
+/**
+ * Created by zhangbo54 on 2019-03-04.
+ */
+public class Main {
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+
+        int[][] arrays = {
+                {1, 2, 3, 4},
+                {5, 6, 7, 8},
+                {9, 10, 11, 12},
+                {13, 14, 15, 16}};
+        solution.rotate(arrays);
+        for (int i = 0; i < arrays.length; i++) {
+            for (int j = 0; j < arrays.length; j++) {
+                System.out.print(arrays[i][j] + ",");
+            }
+            System.out.println("");
+        }
+        System.out.println(arrays);
+    }
+}
+
diff --git a/src/main/java/leetcode/_48_/Solution.java b/src/main/java/leetcode/_48_/Solution.java
@@ -0,0 +1,23 @@
+package leetcode._48_;
+
+class Solution { // 解决这个问题的关键就是知道，图像旋转90度是可以通过先对称镜像，然后对角线镜像可以得到旋转结果
+    public void rotate(int[][] matrix) {
+        // 首先按照水平反转
+
+        for (int j = 0; j < matrix.length / 2; j++) {
+            for (int i = 0; i < matrix.length; i++) {
+                int tmp = matrix[j][i];
+                matrix[j][i] = matrix[matrix.length - 1 - j][i];
+                matrix[matrix.length - 1 - j][i] = tmp;
+            }
+        }
+        // 然后按照对角线反转
+        for (int i = 0; i < matrix.length; i++) {
+            for (int j = i + 1; j < matrix.length; j++) {
+                int tmp = matrix[j][i];
+                matrix[j][i] = matrix[i][j];
+                matrix[i][j] = tmp;
+            }
+        }
+    }
+}
diff --git a/src/main/java/leetcode/_48_/solution.md b/src/main/java/leetcode/_48_/solution.md
@@ -0,0 +1,81 @@
+### [48\. Rotate ImageCopy for MarkdownCopy for Markdown](https://leetcode.com/problems/rotate-image/)
+
+Difficulty: **Medium**
+
+
+You are given an _n_ x _n_ 2D matrix representing an image.
+
+Rotate the image by 90 degrees (clockwise).
+
+**Note:**
+
+You have to rotate the image , which means you have to modify the input 2D matrix directly. **DO NOT** allocate another 2D matrix and do the rotation.
+
+**Example 1:**
+
+```
+Given input matrix = 
+[
+  [1,2,3],
+  [4,5,6],
+  [7,8,9]
+],
+
+rotate the input matrix in-place such that it becomes:
+[
+  [7,4,1],
+  [8,5,2],
+  [9,6,3]
+]
+```
+
+**Example 2:**
+
+```
+Given input matrix =
+[
+  [ 5, 1, 9,11],
+  [ 2, 4, 8,10],
+  [13, 3, 6, 7],
+  [15,14,12,16]
+], 
+
+rotate the input matrix in-place such that it becomes:
+[
+  [15,13, 2, 5],
+  [14, 3, 4, 1],
+  [12, 6, 8, 9],
+  [16, 7,10,11]
+]
+```
+
+
+#### Solution
+
+Language: **Java**
+
+```java
+class Solution { // 解决这个问题的关键就是知道，图像旋转90度是可以通过先对称镜像，然后对角线镜像可以得到旋转结果
+    public void rotate(int[][] matrix) {
+        // 首先按照水平反转
+​
+        for (int j = 0; j < matrix.length / 2; j++) {
+            for (int i = 0; i < matrix.length; i++) {
+                int tmp = matrix[j][i];
+                matrix[j][i] = matrix[matrix.length - 1 - j][i];
+                matrix[matrix.length - 1 - j][i] = tmp;
+            }
+        }
+        // 然后按照对角线反转
+        for (int i = 0; i < matrix.length; i++) {
+            for (int j = i + 1; j < matrix.length; j++) {
+                int tmp = matrix[j][i];
+                matrix[j][i] = matrix[i][j];
+                matrix[i][j] = tmp;
+            }
+        }
+    }
+}
+```
+![](http://ww2.sinaimg.cn/large/006tNc79ly1g4rmwqusm2j31bu0q6n1w.jpg)
+![](http://ww2.sinaimg.cn/large/006tNc79ly1g4rmxspjwaj31410u0ard.jpg)

Original file line number	Diff line number	Diff line change
`@@ -1 +1,3 @@`
`1`	`1`	`# LeetCode-Java`
	`2`	`+`
	`3`	`+用 Java 刷刷 LeetCode，保持思维活跃。`