螺旋矩阵
题目描述:
给你一个正整数 n ,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的 n x n 正方形矩阵 matrix 。
#include<iostream>
#include<vector>
using namespace std;
int main() {
int n = 5;
int matrix[100][100];
int row = 1;
int cow = 1;
int i = 1;
int maxlim = n;
int minlim = 1;
while (true) {
for (; cow < maxlim; cow++)
{
matrix[row][cow] = i++;
}
for (; row < maxlim; row++)
{
matrix[row][cow] = i++;
}
for (; cow > minlim; cow--)
{
matrix[row][cow] = i++;
}
for (; row > minlim; row--)
{
matrix[row][cow] = i++;
}
row++;
cow++;
maxlim--;
minlim++;
if (maxlim <= minlim)break;
}
if (n % 2 != 0)//奇数情况下会有一个中间值赋不到,不改动循环直接赋值就行
matrix[n / 2+1][n / 2+1] = n*n;
for (int m = 1; m < n + 1; m++) {
for (int k = 1; k < n + 1; k++) {
cout << matrix[m][k] << " ";
}
cout << endl;
}
return 0;
}
附leetcode59答案版
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
int matrix[100][100];
int row = 1;
int cow = 1;
int i = 1;
int maxlim = n;
int minlim = 1;
while (true) {
for (; cow < maxlim; cow++){
matrix[row][cow] = i++;
}
for (; row < maxlim; row++){
matrix[row][cow] = i++;
}
for (; cow > minlim; cow--){
matrix[row][cow] = i++;
}
for (; row > minlim; row--){
matrix[row][cow] = i++;
}
row++;
cow++;
maxlim--;
minlim++;
if (maxlim <= minlim)
break;
}
if (n % 2 != 0)
matrix[n / 2+1][n / 2+1] = n*n;
vector<vector<int>> result;
for(int i = 0;i<n;i++){
vector<int> vec1;
for(int j = 0;j<n;j++){
vec1.push_back(matrix[i+1][j+1]);
}
result.push_back(vec1);
}
return result;
}
};
就挺离谱的…