package com.c2;
import java.util.Scanner;
public class Oaa {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n;
System.out.print("请输入方阵的行与列:");
n = in.nextInt();
int[][] a = new int[n][n];
System.out.println("请输入方阵各个元素:");
int i, j;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) {
System.out.print("a[" + i + "][" + j + "]=");
a[i][j] = in.nextInt();
}
for (i = 0; i < n; i++) {
System.out.print("第" + (i + 1) + "行最大值:");
System.out.println(hasMax(a[i], n));
}
System.out.println();
hasMin(a, n);
// System.out.println();
<