题解 | 杨辉三角

#include <stdio.h>

arr[34][34] = { 0 };
int main() {
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= i; j++) {

            if (i == j || j == 0) //之前误用了赋值运算符
                arr[i][j] = 1;
            else {
                arr[i][j] = arr[i - 1][j] + arr[i - 1][j - 1];
            }
        }

    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= i; j++) {
            printf("%d ", arr[i][j]);
        }
        printf("\n");//每行结束换行
    }
    return 0;
}