力扣54.螺旋矩阵
给你一个 m 行 n 列的矩阵 matrix ,请按照 顺时针螺旋顺序 ,返回矩阵中的所有元素。
示例 1:
输入:matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出:[1,2,3,6,9,8,7,4,5]
示例 2:
输入:matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
输出:[1,2,3,4,8,12,11,10,9,5,6,7]
提示:
m == matrix.length
n == matrix[i].length
1 <= m, n <= 10
-100 <= matrix[i][j] <= 100
解题思路:
将输入的矩阵模拟为一维数组,方便添加进答案矩阵,依次判断四条边界右移下移左移上移,直到条件终止
#include <iostream>
using namespace std;
int main()
{
int m, n, a[105], k = 0, q[15][15];
cin >> m >> n;
for(int i = 0; i < m*n; i++)cin >> a[i];
//定义上下左右边界
int u = 0, d = m-1, l = 0, r = n-1;
while(true){
//右移
for(int i = l; i <= r; i++)q[u][i] = a[k++];
//判断,重设上边界
if(++u > d)break;
//下移
for(int i = u; i <= d; i++)q[i][r] = a[k++];
//判断,重设下边界
if(--r < l)break;
//左移
for(int i = r; i >= l; i--)q[d][i] = a[k++];
判断,重设左边界
if(--d < u)break;
//上移
for(int i = d; i >= u; i--)q[i][l] = a[k++];
判断,重设左边界
if(++l > r)break;
}
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
cout<< q[i][j] << " ";
cout << endl;
}
return 0;
}
/*3 3
1 2 3 4 5 6 7 8 9*/