一.题目要求
给定一个 n × n 的二维矩阵 matrix 表示一个图像。请你将图像顺时针旋转 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]]
提示:
n == matrix.length == matrix[i].length
1 <= n <= 20
-1000 <= matrix[i][j] <= 1000
四.解题思路
使用辅助数组先从(0,0)螺旋遍历一遍存数,再从(0,width)遍历填数。
五.代码实现
class Solution {
public:
void rotate(vector<vector<int>>& matrix) {
int i, j;
vector<int> sup;
int width = matrix.size();
int length = matrix[0].size();
int left = 0;
int right = length - 1;
int top = 0;
int bottom = width - 1;
while (left <= right && top <= bottom)
{
for (int i = left; i <= right; i++)
{
sup.push_back(matrix[top][i]);
}
top++;
for (int i = top; i <= bottom; i++)
{
sup.push_back(matrix[i][right]);
}
right--;
if (top <= bottom)
{
for (int i = right; i >= left; i--)
{
sup.push_back(matrix[bottom][i]);
}
bottom--;
}
if (left <= right)
{
for (int i = bottom; i >= top; i--)
{
sup.push_back(matrix[i][left]);
}
left++;
}
}
int n = 0;
left = 0;
right = length - 1;
top = 0;
bottom = width - 1;
while (left <= right && top <= bottom)
{
for (int i = top; i <= bottom; i++)
{
matrix[i][right] = sup[n++];
}
right--;
for (int i = right; i >= left; i--)
{
matrix[bottom][i] = sup[n++];
}
bottom--;
if (left <= right)
{
for (int i = bottom; i >= top; i--)
{
matrix[i][left] = sup[n++];
}
left++;
}
if (top <= bottom)
{
for (int i = left; i <= right; i++)
{
matrix[top][i] = sup[n++];
}
top++;
}
}
}
};
六.题目总结
注意两种极端情况导致重复添加元素,一个 if (top <= bottom) 一个 if (left <= right) 可能的最后两步,要加这两个限制。