Java实现输出“杨辉三角”


import java.util.Scanner;

public class SumTrangles {
    public static void func(int n) {
        if (n < 0) return;
        int[][] a = new int[n][n];
        for (int i = 0;i < n;i++) {
            if (i == 0) {
                a[i][0] = 1;
                System.out.print(1);
            }
            for (int j = 0;j < i;j++) {
                if (j == 0 || j == n - 1) {
                    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();
        }
    }
    public static void main(String[] args) {
        System.out.println("Enter the number:");
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        func(n);
    }
}


免责声明!

本站转载的文章为个人学习借鉴使用,本站对版权不负任何法律责任。如果侵犯了您的隐私权益,请联系本站邮箱yoyou2525@163.com删除。



 
粤ICP备18138465号  © 2018-2025 CODEPRJ.COM