楊輝三角的JAVA實現

package imath;

public class TriangleArray {
public static void main(String[] args) {
final int NMAX = 10; // 行數=NMAX+1

// allocate triangular array
int[][] odds = new int[NMAX + 1][];
for (int n = 0; n <= NMAX; n++)
odds[n] = new int[n + 1];

// fill triangular array
for (int n = 0; n < odds.length; n++) // 行
for (int k = 0; k < odds[n].length; k++) { // 列
/*
* compute binomial coefficient n*(n-1)*(n-2)*...*(n-k+1)/(1*2*3*...*k) // 通項公式
*/
int lotteryOdds = 1;
for (int i = 1; i <= k; i++)
lotteryOdds = lotteryOdds * (n - i + 1) / i;

odds[n][k] = lotteryOdds;
}

// print triangular array
for (int[] row : odds) {
for (int odd : row)
System.out.printf("%4d", odd);
System.out.println();
}
}
}

楊輝三角的JAVA實現

原文：https://www.cnblogs.com/huanglong1987/p/10551681.html