We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
给你一幅由 N × N 矩阵表示的图像,其中每个像素的大小为 4 字节。请你设计一种算法,将图像旋转 90 度。
不占用额外内存空间能否做到?
示例 1:
给定 matrix =
[ [1,2,3], [4,5,6], [7,8,9] ],
原地旋转输入矩阵,使其变为:
[ [7,4,1], [8,5,2], [9,6,3] ]
示例 2:
[ [ 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] ]
leetcode
The text was updated successfully, but these errors were encountered:
思路: 按对角线反转后再逐行倒序
[ [1,2,3], [4,5,6], => [7,8,9] ] [ [1,4,7], [2,5,8], => [3,6,9] ] [ [7,4,1], [8,5,2], => [9,6,3] ]
/** * @param {number[][]} matrix * @return {void} Do not return anything, modify matrix in-place instead. */ var rotate = function(matrix) { const n = matrix.length; //对角线反转 0,0 n-1,n-1 for(let i = 0; i < n; i++) { for(let j = 0; j < i; j++) { swap(matrix, [i, j], [j, i]); } } //中线左右反转 for(let i = 0; i < n; i++) { for(let j = 0; j < n / 2; j++) { swap(matrix, [i, j], [i, n - 1 - j]); } } function swap(matrix, [x1, y1], [x2, y2]) { const tmp = matrix[x1][y1]; matrix[x1][y1] = matrix[x2][y2]; matrix[x2][y2] = tmp; } };
Sorry, something went wrong.
No branches or pull requests
给你一幅由 N × N 矩阵表示的图像,其中每个像素的大小为 4 字节。请你设计一种算法,将图像旋转 90 度。
不占用额外内存空间能否做到?
示例 1:
给定 matrix =
原地旋转输入矩阵,使其变为:
示例 2:
给定 matrix =
原地旋转输入矩阵,使其变为:
leetcode
The text was updated successfully, but these errors were encountered: