题解 | #杨辉三角#
杨辉三角
http://www.nowcoder.com/practice/e671c6a913d448318a49be87850adbcc
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int n=sc.nextInt(); int[][] array=new int[n][n]; for(int i=0;i<n;i++){ for(int j=0;j<=i;j++){ if(j==0||j==i){ array[i][j]=1; }else{ array[i][j]=array[i-1][j-1]+array[i-1][j]; } } } for(int i=0;i<n;i++){ for(int j=0;j<=i;j++){ System.out.printf("%5d",array[i][j]); } System.out.println(); } } }