- public class TriangularArray {
- /**
- * @param args
- */
- public static void main(String[] args) {
- // TODO Auto-generated method stub
- int NMAX = 7;
- int[][] triangularArray = new int[NMAX][];
- for (int i = 0; i < NMAX; i++) {
- for (int j = 0; j <= i + 1; j++) {
- triangularArray[i] = new int[j];
- }
- }
- //兩側數據爲1,中間數據爲[i - 1][j - 1] + [i - 1][j]
- for (int i = 0; i < triangularArray.length; i++) {
- for (int j = 0; j < triangularArray[i].length; j++) {
- if (j == 0 || i == j)
- triangularArray[i][j] = 1;
- else
- triangularArray[i][j] = triangularArray[i - 1][j - 1]
- + triangularArray[i - 1][j];
- }
- }
- for (int[] row : triangularArray) {
- for (int num : row) {
- System.out.printf("%4d", num);
- }
- System.out.println();
- }
- }
- }
java對角線數列的算法
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.