java试题

Question

对于一个二维整型数组，计算各行元素之和并查找其值最小的行

Answer 1

public class Yunian {
public static void main(String[] args) {
int[][ ]a = new int [5][5];
int num = 0;
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
a[i][j] = num++;
}
}

int[] sum = new int[5];

for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
sum[i] += a[i][j];
}
}

for (int i = 0; i < sum.length; i++) {
System.out.println("第" + i + "行的和为：" + sum[i]);
}

int min= sum[0];
for (int i = 0; i < sum.length; i++) {
if (min > sum[i]) {
min = sum[i];
}
}

System.out.println("最大的行：" + min);
}
}