求二维数组的最值及其位置
package s02;
public class Task04_2 {
public static void main(String[] args) {
int m = (int)(Math.random()*10)+1;
int n = (int)(Math.random()*10)+1;
int [][] a = new int[m][n];
int maxn = a[0][0];
int fi = 0, fj = 0;
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
a[i][j] = (int)(Math.random()*100);
if (a[i][j] > maxn) {
maxn = a[i][j];
fi = i;
fj = j;
}
}
}
System.out.println("二维数组为:");
for (int[] i:a) {
for (int j:i) {
System.out.print(j + "t");
}
System.out.println();
}
System.out.println("最大值:" + maxn);
System.out.println("位置是:[" + (fi + 1) + "," + (fj + 1) + "]");
}
}