题解 | #蛇形矩阵#
蛇形矩阵
https://www.nowcoder.com/practice/f228a074c5274619b26be544962375e1
#include<stdio.h> int main() { int n, i, j; scanf("%d", &n); int h, l, a[100][100]; int sum = 1; for (i = 1; i <= n * 2 - 1; i++) { h = i; l = 1; while (h >= 1) { if (l <= n && h <= n) { if (i % 2 != 0) a[h][l] = sum++; else a[l][h] = sum++; } h--; l++; } } for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { printf("%d ", a[i][j]); } printf("\n"); } return 0; }