Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 8c67f34

Browse files
authored
feat: add go solution to lc problem: No.0048 (#838)
No.0048.Rotate Image
1 parent 7a27318 commit 8c67f34

File tree

3 files changed

+54
-0
lines changed

3 files changed

+54
-0
lines changed

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

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -192,6 +192,25 @@ impl Solution {
192192
}
193193
```
194194

195+
### **Go**
196+
197+
```go
198+
func rotate(matrix [][]int) {
199+
n := len(matrix)
200+
for i := 0; i < n; i++ {
201+
for j := i; j < n; j++ {
202+
matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]
203+
}
204+
}
205+
206+
for i := 0; i < n; i++ {
207+
for j, k := 0, n-1; j < k; j, k = j+1, k-1 {
208+
matrix[i][j], matrix[i][k] = matrix[i][k], matrix[i][j]
209+
}
210+
}
211+
}
212+
```
213+
195214
### **...**
196215

197216
```

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

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -178,6 +178,26 @@ impl Solution {
178178
}
179179
```
180180

181+
### **Go**
182+
183+
```go
184+
func rotate(matrix [][]int) {
185+
n := len(matrix)
186+
// matrix transpose
187+
for i := 0; i < n; i++ {
188+
for j := i; j < n; j++ {
189+
matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]
190+
}
191+
}
192+
// reverse each matrix[i]
193+
for i := 0; i < n; i++ {
194+
for j, k := 0, n-1; j < k; j, k = j+1, k-1 {
195+
matrix[i][j], matrix[i][k] = matrix[i][k], matrix[i][j]
196+
}
197+
}
198+
}
199+
```
200+
181201
### **...**
182202

183203
```
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
func rotate(matrix [][]int) {
2+
n := len(matrix)
3+
// matrix transpose
4+
for i := 0; i < n; i++ {
5+
for j := i; j < n; j++ {
6+
matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]
7+
}
8+
}
9+
// reverse each matrix[i]
10+
for i := 0; i < n; i++ {
11+
for j, k := 0, n-1; j < k; j, k = j+1, k-1 {
12+
matrix[i][j], matrix[i][k] = matrix[i][k], matrix[i][j]
13+
}
14+
}
15+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /