程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> leetcode - Spiral Matrix II

leetcode - Spiral Matrix II

編輯:C++入門知識

leetcode - Spiral Matrix II


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 ]
]

class Solution {
public:
    std::vector > generateMatrix(int n) {
		std::vector> matrix(n,std::vector(n,0));
		int start = 0, end = n - 1;
		int step = 1;
		while(start < end)
		{
			for (int i = start; i < end; i++)
			{
				matrix[start][i] = step++;
			}
			for (int i = start; i < end; i++)
			{
				matrix[i][end] = step++;
			}
			for(int i = end; i > start; i--)
			{
				matrix[end][i] = step++;
			}
			for(int i = end; i > start; i--)
			{
				matrix[i][start] = step++;
			}
			start++;
			end--;
		}
		if(start == end)
		{
			matrix[start][end] = step++;
		}
		return matrix;
    }
};


  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved