1125: 上三角矩阵的判断java

import java.util.*;

public class Main{
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int [][] arr = new int[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                arr[i][j] = input.nextInt();
            }
        }

        if(Judge_duijiao(arr) == 1 && Judge_xia(arr) == 1)
        {
            System.out.println("YES");
        }
        else {
            System.out.println("NO");
        }

    }
    
    private static int Judge_duijiao(int[][] arr) {
        int flag = 0;
        for (int i = 0; i < arr.length; i++) {
            if(arr[i][i] == 0){
                flag++;
            }
        }
        if(flag == arr.length) return 0;
        else return 1;
    }

    private static int Judge_xia(int[][] arr){
        int flag = 0;

        for (int i = 1; i < arr.length; i++) {
            for (int j = 0; j < i; j++) {
                if(arr[i][j] != 0){
                    flag ++;
                    break;
                }else {
                    flag = 0;
                }
            }
        }
        if(flag == 0) return 1;
        else return 0;
    }
}