杨辉三角（一维数组实现）

代码：

package com.cb;

import org.apache.log4j.Logger;

import java.util.Scanner;


public class Test1 {

    private static Logger logger = Logger.getLogger(Test1.class);

    /**
     * 思路：现在的值等于上一行中的“现在的值”加上之前的值（previous）
     * 用一纬数组表述二纬数组算法
     */
    public static void yhTrangle() {

        logger.info("input line number!");
        Scanner scanner = new Scanner(System.in);
        int x = scanner.nextInt();
        int[] a = new int[x + 1];
        int prevoius = 1;
        for (int i = 1; i <= a.length; i++) {
            for (int j = 1; j < i; j++) {
                int current = a[j];
                a[j] = prevoius + current;
                prevoius = current;
                System.out.print(a[j] + " ");
            }
            System.out.println();
        }
    }

    public static void main(String[] args) {

        Test1.yhTrangle();
    }
}

结果：