-
Notifications
You must be signed in to change notification settings - Fork 0
/
48.旋转图像.js
87 lines (85 loc) · 1.72 KB
/
48.旋转图像.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
/*
* @lc app=leetcode.cn id=48 lang=javascript
*
* [48] 旋转图像
*
* https://leetcode-cn.com/problems/rotate-image/description/
*
* algorithms
* Medium (71.64%)
* Likes: 719
* Dislikes: 0
* Total Accepted: 128.9K
* Total Submissions: 180K
* Testcase Example: '[[1,2,3],[4,5,6],[7,8,9]]'
*
* 给定一个 n × n 的二维矩阵表示一个图像。
*
* 将图像顺时针旋转 90 度。
*
* 说明:
*
* 你必须在原地旋转图像,这意味着你需要直接修改输入的二维矩阵。请不要使用另一个矩阵来旋转图像。
*
* 示例 1:
*
* 给定 matrix =
* [
* [1,2,3],
* [4,5,6],
* [7,8,9]
* ],
*
* 原地旋转输入矩阵,使其变为:
* [
* [7,4,1],
* [8,5,2],
* [9,6,3]
* ]
*
*
* 示例 2:
*
* 给定 matrix =
* [
* [ 5, 1, 9,11],
* [ 2, 4, 8,10],
* [13, 3, 6, 7],
* [15,14,12,16]
* ],
*
* 原地旋转输入矩阵,使其变为:
* [
* [15,13, 2, 5],
* [14, 3, 4, 1],
* [12, 6, 8, 9],
* [16, 7,10,11]
* ]
*
*
*/
// @lc code=start
/**
* @param {number[][]} matrix
* @return {void} Do not return anything, modify matrix in-place instead.
* 先上下反转,再主对角线反转
*/
var rotate = function(matrix) {
let n = matrix.length
for(let i = 0; i < Math.floor(n/2); i++ ) {
for(let j = 0; j < n; j++) {
let temp = matrix[i][j]
matrix[i][j] = matrix[n-1-i][j]
matrix[n-1-i][j] = temp
}
}
for(let i = 0; i < n; i++) {
for(j = i+1; j < n; j++) {
let temp = matrix[i][j]
matrix[i][j] = matrix[j][i]
matrix[j][i] = temp
}
}
return matrix
};
// @lc code=end