leetcode 059 Spiral Matrix II

最新推荐文章于 2020-07-02 06:22:04 发布

walter1990

最新推荐文章于 2020-07-02 06:22:04 发布

阅读量262

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/suichen1/article/details/51287157

Leetcode 专栏收录该内容

127 篇文章

订阅专栏

本文介绍了一个生成螺旋矩阵的算法，该算法接收一个整数n作为输入，并生成一个n×n的螺旋矩阵，矩阵元素从1到n²按螺旋顺序填充。通过调整开始行和结束行等变量来控制填充范围。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

For example,
Given n = 3,

You should return the following matrix:

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

Subscribe to see which companies asked this question

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        int len = n*n;

		int rows = n, cols = n;

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

		int beginRow=0, endRow=rows-1, beginCol=0, endCol=cols-1;
		int cnt = 0;

		for(; beginRow <= endRow && beginCol <= endCol; beginRow++, endRow--, beginCol++, endCol--) {
			int tempCol = beginCol;

			while(tempCol <= endCol) {
				matrix[beginRow][tempCol] = cnt+1;
				cnt++;
				tempCol++;
			}

			int tempRow = beginRow+1;

			while(tempRow <= endRow) {
				matrix[tempRow][endCol] = cnt+1;
				cnt++;
				tempRow++;
			}

			tempCol = endCol-1;

			while(tempCol >= beginCol) {
				matrix[endRow][tempCol] = cnt+1;
				cnt++;
				tempCol--;
			}

			tempRow = endRow-1;

			while(tempRow > beginRow) {
				matrix[tempRow][beginCol] = cnt+1;
				cnt++;
				tempRow--;
			}
		}

		return matrix;
    }
};