二维数组
应用
public class Test1 {
public static void main(String[] args) {
int[] num1= {0,0,1,1,0};
int[] num2= {1,1,1,0,1};
int[] num3= {1,1,0,0,0};
int[] num4= {1,0,1,0,1};
int[][] nums= {num1,num2,num3,num4};
for (int i = 0; i < nums.length; i++) {
for (int j = 0; j < nums[i].length; j++) {
System.out.print(nums[i][j]+" ");
}
System.out.println();
}
//求每一行的1
int max=0;
int row=0;//row记录1最多的行的索引
for (int i = 0; i < nums.length; i++) {//行
//求个数
int count=0;
for (int j = 0; j < nums[i].length; j++) {//列
if(nums[i][j]==1) {
count++;//当数组中某一行的元素为1是 count+1
}
}
if(max<count) {
max=count;
row=i;
}
}
System.out.println("最多的1有"+max);
System.out.println("最多的1的行的索引是"+row);
//求1最多的列
int max1=0;
int row1=0;
for (int i = 0; i < nums[0].length; i++) {//列
int count1=0;
for (int j = 0; j < nums.length; j++) {//行
if(nums[j][i]==1) {
count1++;
}
}
if(max1<count1) {
max1=count1;
row1=i;
}
}
System.out.println("最多的1有"+max1);
System.out.println("最多的1的列的索引是"+row1);
}
}