feat: add python and java solutions to leetcode problem: No.0048

Author: yanglbme

solution/0000-0099/0048.Rotate Image/README.md

@@ -60,15 +60,44 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def rotate(self, matrix: List[List[int]]) -> None:
+        """
+        Do not return anything, modify matrix in-place instead.
+        """
+        s, n = 0, len(matrix)
+        while s < (n >> 1):
+            e = n - s - 1
+            for i in range(s, e):
+                t = matrix[i][e]
+                matrix[i][e] = matrix[s][i]
+                matrix[s][i] = matrix[n - i - 1][s]
+                matrix[n - i - 1][s] = matrix[e][n - i - 1]
+                matrix[e][n - i - 1] = t
+            s += 1
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public void rotate(int[][] matrix) {
+        int s = 0, n = matrix.length;
+        while (s < (n >> 1)) {
+            int e = n - s - 1;
+            for (int i = s; i < e; ++i) {
+                int t = matrix[i][e];
+                matrix[i][e] = matrix[s][i];
+                matrix[s][i] = matrix[n - i - 1][s];
+                matrix[n - i - 1][s] = matrix[e][n - i - 1];
+                matrix[e][n - i - 1] = t;
+            }
+            ++s;
+        }
+    }
+}
 ```
 
 ### **...**

solution/0000-0099/0048.Rotate Image/README_EN.md

@@ -87,13 +87,42 @@ rotate the input matrix <strong>in-place</strong> such that it becomes:
 ### **Python3**
 
 ```python
-
+class Solution:
+    def rotate(self, matrix: List[List[int]]) -> None:
+        """
+        Do not return anything, modify matrix in-place instead.
+        """
+        s, n = 0, len(matrix)
+        while s < (n >> 1):
+            e = n - s - 1
+            for i in range(s, e):
+                t = matrix[i][e]
+                matrix[i][e] = matrix[s][i]
+                matrix[s][i] = matrix[n - i - 1][s]
+                matrix[n - i - 1][s] = matrix[e][n - i - 1]
+                matrix[e][n - i - 1] = t
+            s += 1
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public void rotate(int[][] matrix) {
+        int s = 0, n = matrix.length;
+        while (s < (n >> 1)) {
+            int e = n - s - 1;
+            for (int i = s; i < e; ++i) {
+                int t = matrix[i][e];
+                matrix[i][e] = matrix[s][i];
+                matrix[s][i] = matrix[n - i - 1][s];
+                matrix[n - i - 1][s] = matrix[e][n - i - 1];
+                matrix[e][n - i - 1] = t;
+            }
+            ++s;
+        }
+    }
+}
 ```
 
 ### **...**

solution/0000-0099/0048.Rotate Image/Solution.java

@@ -1,20 +1,16 @@
 class Solution {
     public void rotate(int[][] matrix) {
-        if(matrix==null) return;
-        int n=matrix.length;
-        for(int i=0;i<n;i++){
-            for(int j=i;j<n;j++){
-                int temp=matrix[i][j];
-                matrix[i][j]=matrix[j][i];
-                matrix[j][i]=temp;
-            }
-        }
-        for(int i=0;i<n;i++){
-            for(int j=0;j<n/2;j++){
-                int temp = matrix[i][j];
-                matrix[i][j] = matrix[i][matrix.length-1-j];
-                matrix[i][matrix.length-1-j] = temp;
+        int s = 0, n = matrix.length;
+        while (s < (n >> 1)) {
+            int e = n - s - 1;
+            for (int i = s; i < e; ++i) {
+                int t = matrix[i][e];
+                matrix[i][e] = matrix[s][i];
+                matrix[s][i] = matrix[n - i - 1][s];
+                matrix[n - i - 1][s] = matrix[e][n - i - 1];
+                matrix[e][n - i - 1] = t;
             }
+            ++s;
         }
     }
 }

solution/0000-0099/0048.Rotate Image/Solution.py

@@ -0,0 +1,15 @@
+class Solution:
+    def rotate(self, matrix: List[List[int]]) -> None:
+        """
+        Do not return anything, modify matrix in-place instead.
+        """
+        s, n = 0, len(matrix)
+        while s < (n >> 1):
+            e = n - s - 1
+            for i in range(s, e):
+                t = matrix[i][e]
+                matrix[i][e] = matrix[s][i]
+                matrix[s][i] = matrix[n - i - 1][s]
+                matrix[n - i - 1][s] = matrix[e][n - i - 1]
+                matrix[e][n - i - 1] = t
+            s += 1