杨辉三角一维数组实现

<img src="https://img-blog.csdn.net/20150729133723412?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />

附上图片，是为了在学习之余驻足观看美的事物，哈哈

<p>package java7_22;</p><p> </p><p>importjava.util.Scanner;</p><p> </p><p>/**</p><p> * Created by Nazir Abu on 2015/7/22.</p><p> */</p><p>public classYangHuiTrangle{</p><p>    public static void main(String[] args) {</p><p>       // int N = Integer.parseInt(args[0]);</p><p>        Scanner scanner=new Scanner(System.in);</p><p>        intN=Integer.parseInt(scanner.nextLine());</p><p>        int a[] = new int[N];</p><p>        a[0] = 1;</p><p>        for (int i = 0; i < N; i++) {</p><p>            for (int p = 0; p < N - i - 1;p++) {</p><p>                System.out.print("   ");</p><p>            }</p><p>            for (int j = i; j >= 0; j--) {</p><p>                try {</p><p>                    a[j] = a[j - 1] + a[j];</p><p>                   System.out.printf("%-6d", a[j]);</p><p>                } catch (Exception e) {</p><p>                    a[j] = 1;</p><p>                   System.out.printf("%-6d", a[j]);</p><p>                }</p><p>            }</p><p>            System.out.println();</p><p>        }</p><p>    }</p><p>}</p>