solve problem Rotate Image

Author: P-ppc

README.md

@@ -289,6 +289,7 @@ All solutions will be accepted!
 |537|[Complex Number Multiplication](https://leetcode-cn.com/problems/complex-number-multiplication/description/)|[java/py/js](./algorithms/ComplexNumberMultiplication)|Medium|
 |228|[Summary Ranges](https://leetcode-cn.com/problems/summary-ranges/description/)|[java/py/js](./algorithms/SummaryRanges)|Medium|
 |890|[Find And Replace Pattern](https://leetcode-cn.com/problems/find-and-replace-pattern/description/)|[java/py/js](./algorithms/FindAndReplacePattern)|Medium|
+|48|[Rotate Image](https://leetcode-cn.com/problems/rotate-image/description/)|[java/py/js](./algorithms/RotateImage)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/RotateImage/README.md

@@ -0,0 +1,2 @@
+# Rotate Image
+This problem is easy to solve

algorithms/RotateImage/Solution.java

@@ -0,0 +1,28 @@
+class Solution {
+    public void rotate(int[][] matrix) {
+        int n = matrix.length,
+            i = 0;
+        
+        while (i < n / 2) {
+            int x = i,
+                y = i;
+            
+            while (y < n - 1 - i) {
+                matrix[x][y] += matrix[y][n - 1 -x];
+                matrix[y][n - 1 -x] = matrix[x][y] - matrix[y][n - 1 -x];
+                matrix[x][y] -= matrix[y][n - 1 -x];
+
+                matrix[x][y] += matrix[n - 1 - x][n - 1 - y];
+                matrix[n - 1 - x][n - 1 - y] = matrix[x][y] - matrix[n - 1 - x][n - 1 - y];
+                matrix[x][y] -= matrix[n - 1 - x][n - 1 - y];
+
+                matrix[x][y] += matrix[n - 1 - y][x];
+                matrix[n - 1 - y][x] = matrix[x][y] - matrix[n - 1 - y][x];
+                matrix[x][y] -= matrix[n - 1 - y][x];
+
+                y++;
+            }
+            i++;
+        }
+    }
+}

algorithms/RotateImage/solution.js

@@ -0,0 +1,30 @@
+/**
+ * @param {number[][]} matrix
+ * @return {void} Do not return anything, modify matrix in-place instead.
+ */
+var rotate = function(matrix) {
+    let n = matrix.length,
+        i = 0
+    
+    while (i < parseInt(n / 2)) {
+        let x = i,
+            y = i
+        
+        while (y < n - 1 - i) {
+            matrix[x][y] += matrix[y][n - 1 -x]
+            matrix[y][n - 1 -x] = matrix[x][y] - matrix[y][n - 1 -x]
+            matrix[x][y] -= matrix[y][n - 1 -x]
+            
+            matrix[x][y] += matrix[n - 1 - x][n - 1 - y]
+            matrix[n - 1 - x][n - 1 - y] = matrix[x][y] - matrix[n - 1 - x][n - 1 - y]
+            matrix[x][y] -= matrix[n - 1 - x][n - 1 - y]
+            
+            matrix[x][y] += matrix[n - 1 - y][x]
+            matrix[n - 1 - y][x] = matrix[x][y] - matrix[n - 1 - y][x]
+            matrix[x][y] -= matrix[n - 1 - y][x]
+            
+            y++ 
+        }
+        i++
+    }
+};

algorithms/RotateImage/solution.py

@@ -0,0 +1,20 @@
+class Solution(object):
+    def rotate(self, matrix):
+        """
+        :type matrix: List[List[int]]
+        :rtype: void Do not return anything, modify matrix in-place instead.
+        """
+        n = len(matrix)
+        i = 0
+        
+        while i < n / 2:
+            x = i
+            y = i
+            
+            while y < n - 1 - i:
+                matrix[x][y], matrix[y][n - 1 -x] = matrix[y][n - 1 -x], matrix[x][y]
+                matrix[x][y], matrix[n - 1 - x][n - 1 - y] = matrix[n - 1 - x][n - 1 - y], matrix[x][y]
+                matrix[x][y], matrix[n - 1 - y][x] = matrix[n - 1 - y][x], matrix[x][y]
+                y += 1
+            
+            i += 1