杨辉三角:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
……………………
public class TwoDimensional04{
public class Hello{
public static void main(String[] args){
/*观察到:
(1)杨辉三角的每i行都有i个元素
(2)每一行和最后一行的元素都是1
(3)从第三行开始,对于非1元素,都是:a[i][j] = a[i-1][j]+a[i-1][j-1]
*/
Scanner myScanner = new Scanner(System.in);
System.out.println("请输入您想得到的杨辉三角的行数");
int num = myScanner.nextInt();
int arr[][] = new int[num][];
for(int i = 0; i<arr.length; i++){
arr[i] = new int [i+1];
for(int j = 0;j<arr[i].length;j++){
if(j == 0 || j == arr[i].length-1){
arr[i][j] = 1;
}else{
arr[i][j] = arr[i-1][j]+