corejava第10版
This commit is contained in:
1 parent
2021c3c227
commit
6165543dd3
1088 files changed
+94411
No files matched your search
@@ -0,0 +1,39 @@
|
||||
/**
|
||||
* This program demonstrates a triangular array.
|
||||
* @version 1.20 2004-02-10
|
||||
* @author Cay Horstmann
|
||||
*/
|
||||
public class LotteryArray
|
||||
{
|
||||
public static void main(String[] args)
|
||||
{
|
||||
final int NMAX = 10;
|
||||
|
||||
// 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();
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in new issue
Block a user