HJ35华为机试题解 | #蛇形矩阵#

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int N = 0;
    while (cin >> N) { // 注意 while 处理多个 case
        std::vector<std::vector<int>> matrix;
        matrix.resize(N);
        for (int i = 0; i < matrix.size(); i++) {
            for (int j = 0; j < matrix.size(); j++) {
                matrix[i].push_back(0);
            }
        }
        int count = 1;
        matrix[0][0] = 1;
        for (int row = 0; row < N; row++) {
            for (int k = 0; k <= row; k++) {
                matrix[row - k][k] = count++;
            }
        }
        for (int i = 0; i < matrix.size(); i++) {
            for (int j = 0; j < matrix.size(); j++) {
                if (matrix[i][j] != 0) {
                    cout << matrix[i][j] << ' ';
                }
            }
            cout << std::endl;
        }
    }

    return 0;
}