feat: add solutions to leetcode problem: No.0867

Author: yanglbme

solution/0800-0899/0867.Transpose Matrix/README.md

@@ -9,6 +9,8 @@
 
 <p>矩阵的转置是指将矩阵的主对角线翻转，交换矩阵的行索引与列索引。</p>
 
+![](./images/hint_transpose.png)
+
 <p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
@@ -43,15 +45,54 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def transpose(self, matrix: List[List[int]]) -> List[List[int]]:
+        m, n = len(matrix), len(matrix[0])
+        res = [[0] * m for _ in range(n)]
+        for i in range(n):
+            for j in range(m):
+                res[i][j] = matrix[j][i]
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int[][] transpose(int[][] matrix) {
+        int m = matrix.length, n = matrix[0].length;
+        int[][] res = new int[n][m];
+        for (int i = 0; i < n; ++i) {
+            for (int j = 0; j < m; ++j) {
+                res[i][j] = matrix[j][i];
+            }
+        }
+        return res;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[][]} matrix
+ * @return {number[][]}
+ */
+var transpose = function (matrix) {
+  const m = matrix.length,
+    n = matrix[0].length;
+  let res = [];
+  for (let i = 0; i < n; ++i) {
+    res[i] = [];
+    for (let j = 0; j < m; ++j) {
+      res[i][j] = matrix[j][i];
+    }
+  }
+  return res;
+};
 ```
 
 ### **...**

solution/0800-0899/0867.Transpose Matrix/README_EN.md

@@ -58,13 +58,52 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def transpose(self, matrix: List[List[int]]) -> List[List[int]]:
+        m, n = len(matrix), len(matrix[0])
+        res = [[0] * m for _ in range(n)]
+        for i in range(n):
+            for j in range(m):
+                res[i][j] = matrix[j][i]
+        return res
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int[][] transpose(int[][] matrix) {
+        int m = matrix.length, n = matrix[0].length;
+        int[][] res = new int[n][m];
+        for (int i = 0; i < n; ++i) {
+            for (int j = 0; j < m; ++j) {
+                res[i][j] = matrix[j][i];
+            }
+        }
+        return res;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[][]} matrix
+ * @return {number[][]}
+ */
+var transpose = function (matrix) {
+  const m = matrix.length,
+    n = matrix[0].length;
+  let res = [];
+  for (let i = 0; i < n; ++i) {
+    res[i] = [];
+    for (let j = 0; j < m; ++j) {
+      res[i][j] = matrix[j][i];
+    }
+  }
+  return res;
+};
 ```
 
 ### **...**

solution/0800-0899/0867.Transpose Matrix/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public int[][] transpose(int[][] matrix) {
+        int m = matrix.length, n = matrix[0].length;
+        int[][] res = new int[n][m];
+        for (int i = 0; i < n; ++i) {
+            for (int j = 0; j < m; ++j) {
+                res[i][j] = matrix[j][i];
+            }
+        }
+        return res;
+    }
+}

solution/0800-0899/0867.Transpose Matrix/Solution.js

@@ -1,20 +1,16 @@
 /**
- * @param {number[][]} A
+ * @param {number[][]} matrix
  * @return {number[][]}
  */
-
-/**
- *  Author: Mcnwork2018
- */
-
-var transpose = function (A) {
-  if (A.length === 1 && A[0].length === 1) return A;
-  let tran_matrix = [];
-  for (let i = 0; i < A[0].length; ++i) {
-    tran_matrix[i] = [];
-    for (let j = 0; j < A.length; ++j) {
-      tran_matrix[i][j] = A[j][i];
+var transpose = function (matrix) {
+  const m = matrix.length,
+    n = matrix[0].length;
+  let res = [];
+  for (let i = 0; i < n; ++i) {
+    res[i] = [];
+    for (let j = 0; j < m; ++j) {
+      res[i][j] = matrix[j][i];
     }
   }
-  return tran_matrix;
+  return res;
 };

solution/0800-0899/0867.Transpose Matrix/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def transpose(self, matrix: List[List[int]]) -> List[List[int]]:
+        m, n = len(matrix), len(matrix[0])
+        res = [[0] * m for _ in range(n)]
+        for i in range(n):
+            for j in range(m):
+                res[i][j] = matrix[j][i]
+        return res