java 求鞍点

//
// Source code recreated from a .class file by IntelliJ IDEA
// (powered by FernFlower decompiler)
//

import java.util.Scanner;

public class Main {
    public Main() {
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int max = 0;
        int s = 0;
        int count = 0;
        boolean flag = true;
        System.out.println("请输入数组的列数:");
        int w = sc.nextInt();
        System.out.println("请输入数组的行数:");
        int h = sc.nextInt();
        System.out.println("请输入数组:");
        int[][] arrays = new int[w][h];

        int i;
        int j;
        for(i = 0; i < w; ++i) {
            for(j = 0; j < h; ++j) {
                arrays[i][j] = sc.nextInt();
            }
        }

        for(i = 0; i < w; ++i) {
            for(j = 0; j < h; ++j) {
                max = arrays[i][0];
                max = Math.max(max, arrays[i][j]);
            }

            for(j = 0; j < h; ++j) {
                if (arrays[i][j] == max) {
                    s = j;
                    break;
                }
            }

            for(j = 0; j < w; ++j) {
                if (max - arrays[j][s] < 0) {
                    flag = false;
                    break;
                }

                flag = true;
            }

            if (flag) {
                System.out.println("鞍点是：");
                System.out.println(max);
                ++count;
            } else if (!flag) {
                flag = true;
            }
        }

        if (count == 0) {
            System.out.println("没有鞍点");
        }

    }
}