力扣54. 螺旋矩阵(按层模拟)
https://leetcode-cn.com/problems/spiral-matrix/
按层模拟
- 从左到右,到最右时下移一行,直到下移一行超过了最下
- 从上到下,到最下时左移一列,直到左移一列超过了最左
- 从右到左,到最左时上移一行,直到上移一行超过了最上
- 从下到上,到最上时右移一列,直到右移一列超过了最右
复杂度分析
时间复杂度:O(mn),其中 m 和 n 分别是输入矩阵的行数和列数。矩阵中的每个元素都要被访问一次。
空间复杂度:O(1)。除了输出数组以外,空间复杂度是常数。
// 54spiralOrder.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//
#include <iostream>
#include<vector>
using namespace std;
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
vector<int> result;
int m = matrix.size();//行
if (m == 0)
{
return result;
}
int n = matrix[0].size();//列
int top = 0;
int down = m - 1;
int left = 0;
int right = n - 1;
while (true)
{
for (int i = left; i <= right; i++)//从左到右,到最右时下移一行
{
result.push_back(matrix[top][i]);
}
top++;
if (top > down)break;
for (int i = top; i <= down; i++)//从上到下,到最下时左移一列
{
result.push_back(matrix[i][right]);
}
right--;
if (right < left)break;
for (int i = right; i >= left; i--)//从右到左,到最左时上移一行
{
result.push_back(matrix[down][i]);
}
down--;
if (down < top)break;
for (int i = down; i >= top; i--)//从下到上,到最上时右移一列
{
result.push_back(matrix[i][left]);
}
left++;
if (left > right)break;
}
return result;
}
};
int main()
{
vector<vector<int>> matrix = { {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} };
//{ {3},{2}};
//{ {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} };
Solution s;
auto result = s.spiralOrder(matrix);
for (int i = 0; i < result.size(); i++)
{
cout << result[i] << " ";
}
std::cout << "Hello World!\n";
}