We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b7ed0df commit 11a7f59Copy full SHA for 11a7f59
src/main/java/leetcode/_48_/Solution.java
@@ -2,8 +2,7 @@
2
3
class Solution { // 解决这个问题的关键就是知道,图像旋转90度是可以通过先对称镜像,然后对角线镜像可以得到旋转结果
4
public void rotate(int[][] matrix) {
5
- // 首先按照水平反转
6
-
+ // 首先垂直镜像反转
7
for (int j = 0; j < matrix.length / 2; j++) {
8
for (int i = 0; i < matrix.length; i++) {
9
int tmp = matrix[j][i];
src/main/java/leetcode/_48_/solution.md
@@ -57,8 +57,7 @@ Language: **Java**
57
```java
58
59
60
61
-
62
63
64
0 commit comments