题目描述
蛇形矩阵,是由1开始的自然数一次排列成的N*N的正方形矩阵,数字依次由外而内的递增。如 N=3时蛇形矩阵为:
1 2 3
8 9 4
7 6 5
N=6时蛇形矩阵为:
1 2 3 4 5 6
20 21 22 23 24 7
19 32 33 34 25 8
18 31 36 35 26 9
17 30 29 28 27 10
16 15 14 13 12 11
输入蛇形矩阵宽度,动态分配二维数组,设置蛇形矩阵并输出结果。
输入
测试次数t
每组测试数据一行:数组大小N(>0)
输出
对每组测试数据,输出计算得到的蛇形矩阵。每行元素间以空格分隔,最后一个元素后无空格。
每组测试数据之间以空行分隔。
参考代码
#include<iostream>
using namespace std;
void xia(int** arr, int n, int i, int j, int sum, int num);
void shang(int** arr, int n, int i, int j, int sum, int num);
void zuo(int** arr, int n, int i, int j, int sum, int num);
void you(int** arr, int n, int i, int j, int sum, int num)//指针数组,n行,第i行,第j列,总共的数
{
;
for (int k3 = 0; k3 < n; k3++) {
sum += 1;
arr[i][j] = sum;
if (k3 != n - 1) { j += 1; }
}
if (sum != num) {
xia(arr, n - 1, i + 1, j, sum, num);
}
}
void xia(int** arr, int n, int i, int j, int sum, int num)
{
for (int k4 = 0; k4 < n; k4++) {
sum += 1;
arr[i][j] = sum;
if (k4 != n - 1) { i += 1; }
}
if (sum != num) {
zuo(arr, n, i, j - 1, sum, num);
}
}
void zuo(int** arr, int n, int i, int j, int sum, int num)
{
for (int k2 = 0; k2 < n; k2++) {
sum += 1;
arr[i][j] = sum;
if (k2 != n - 1) { j -= 1; }
}
if (sum != num) {
shang(arr, n - 1, i - 1, j, sum, num);
}
}
void shang(int** arr, int n, int i, int j, int sum, int num)
{
for (int k1 = 0; k1 < n; k1++) {
sum += 1;
arr[i][j] = sum;
if (k1 != n - 1) { i -= 1; }
}
if (sum != num) {
you(arr, n, i, j + 1, sum, num);
}}
int main()
{
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
if (n == 1) {
cout << "1" << endl;
cout << endl;
}
else {
int** arr = new int* [n];
for (int v = 0; v < n; v++) {
arr[v] = new int[n];
}
int i = 0, j = 0, sum = 0, num = n * n;
you(arr, n, i, j, sum, num);
for (int a = 0; a < n; a++) {
for (int c = 0; c < n; c++) {
cout << arr[a][c];
if (c == n - 1)cout << endl;
else cout << " ";
}
}
cout << endl;
for (int b = 0; b < n; b++) {
delete[] arr[b];
}
delete[] arr;
}
}
return 0;
}