forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.js
39 lines (38 loc) · 1.05 KB
/
Solution.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
/**
* @param {number[][]} matrix
* @return {void} Do not return anything, modify matrix in-place instead.
*/
const rotate1 = function(matrix) {
// function swap(x,y){
// console.log(x,y);
// let z = x;
// x = y;
// y = z;
// }
for(let i = 0; i < matrix.length; i++){
for(let j = 0; j <= i; j++){
// swap(matrix[i][j],matrix[j][i]);
// let t = matrix[i][j];
// matrix[i][j] = matrix[j][i];
// matrix[j][i] = t;
[matrix[i][j],matrix[j][i]] = [matrix[j][i],matrix[i][j]];
}
}
for(let i = 0, j = matrix.length -1; i < j; i++, j--){
for(let k = 0; k < matrix.length; k++){
// swap(matrix[k][i], matrix[k][j]);
// let t = matrix[k][i];
// matrix[k][i] = matrix[k][j];
// matrix[k][j] = t;
[matrix[k][i], matrix[k][j]] = [matrix[k][j],matrix[k][i]];
}
}
};
const rotate = function(matrix){
matrix = matrix.reverse();
for(let i = 0 ; i < matrix.length; i++){
for(let j = 0; j < i; j++){
[matrix[i][j],matrix[j][i]] = [matrix[j][i],matrix[i][j]];
}
}
};