java算法——杨辉三角

package yanghuisanjiao;

import java.util.Scanner;

public class yanghuisanjiao {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[][] a = new int[n][n];//存储杨辉三角
		for(int i=0;i<=n;i++){
			for(int j=0;j<=i;j++){
				if(j==0||j==i)
					a[i][j]=1;
				else
					a[i][j]=a[i-1][j-1]+a[i-1][j];
				System.out.print(a[i][j]+" ");
			}
			System.out.println();
		}
	}
}

---