题解 | 蛇形矩阵

#include<stdio.h>
int main() {
    int count = 1;
    int num[100][100];
    int n;
    
    scanf("%d", &n);
    int i, j, k;
    for (i = 0; i < n; i++) {
        if ((i + 1) % 2 == 0) {
            for (k = 0; k <= i; k++) {
                num[k][i - k] = count;
                count++;
            }
        } else {
            for (k = i; k >= 0; k--) {
                num[k][i - k] = count;
                count++;
            }
        }
    }
    for (i = n - 1; i >= 1; i--) {
        if (i % 2 == 0) {
            for (k = n - 1; k >= n - i; k--) {
                num[2 * n - 1 - i - k][k] = count;
                count++;
            }
        } else {
            for (k = n - 1; k >= n - i; k--) {
                num[k][2 * n - 1 - i - k] = count;
                count++;
            }
        }
    }
    for (int m = 0; m < n; m++) {
        for (int x = 0; x < n; x++) {
            printf("%d ", num[m][x]);
        }
        printf("\n");
    }
    return 0;
}