杨辉三角形-C描述

杨辉三角形-C描述

int a[N][N] = { 0 };for (int i = 0; i < N*N; i++){//a[i / N][i%N] = num++;for (int j = 0; j < N; j++){if (j == 0 || i ==j) {//是对角线a[i][j] = 1;}else {a[i][j] = a[i-1][j-1] + a[i-1][j];}}}for (int j = 0; j < N; j++){if (i == 0 || j==0 || i==j) {a[i][j] = 1;}}