LeetCode Algorithm 0059 - Spiral Matrix II (Medium)

最新推荐文章于 2019-10-01 19:19:04 发布

沙沙的兔子

最新推荐文章于 2019-10-01 19:19:04 发布

阅读量295

点赞数

分类专栏： LeetCode 文章标签： LeetCode array 算法基础

本文链接：https://blog.csdn.net/DarkRabbit/article/details/89735278

版权

LeetCode 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

LeetCode Algorithm 0059 - Spiral Matrix II (Medium)

返回分类：全部文章 >> 基础知识

返回上级：LeetCode 算法目录

Problem Link: https://leetcode.com/problems/spiral-matrix-ii/

Description

Given a positive integer n , generate a square matrix filled with elements from $1$ to $n^2$ in spiral order.

Example:

Input: 3
Output:
[
 [ 1, 2, 3 ],
 [ 8, 9, 4 ],
 [ 7, 6, 5 ]
]

Solution C++

// Author: https://blog.csdn.net/DarkRabbit
// Problem: https://leetcode.com/problems/spiral-matrix-ii/
// Difficulty: Medium
// Related Topics: `Array`

#pragma once

#include "pch.h"

namespace P59SpiralMatrixII
{
    class Solution
    {
        public:
        vector<vector<int>> generateMatrix(int n)
        {
            if (n < 1)
            {
                return vector<vector<int>>();
            }

            vector<vector<int>> matrix = vector<vector<int>>(n, vector<int>(n, 0));

            int val = 1;
            int startRow = 0;
            int startCol = 0;
            int endRow = n - 1;
            int endCol = n - 1;

            while (startRow <= endRow && startCol <= endCol)
            {
                for (int c = startCol; c <= endCol; c++)
                {
                    matrix[startRow][c] = val++;
                }
                startRow++;

                for (int r = startRow; r <= endRow; r++)
                {
                    matrix[r][endCol] = val++;
                }
                endCol--;

                for (int c = endCol; c >= startCol; c--)
                {
                    matrix[endRow][c] = val++;
                }
                endRow--;

                for (int r = endRow; r >= startRow; r--)
                {
                    matrix[r][startCol] = val++;
                }
                startCol++;
            }

            return matrix;
        }
    };
}