package com.st.train;
import java.util.Arrays;
public class DoubleArray {
/**
* 题目:比较二维数组的每一列,然后把较小的一列输出到一个一维数组中
*
*/
public static void main(String[] args) {
int[][] arr = new int[][] {{1},
{1,2,-8,5,94},
{1,2,3,4,5,6},
{1,5,9},
{1,4,7,8,5},
{1,5,4,8}
};
//找出元素最多的一行
int maxLen = arr[0].length;
for(int x = 0 ; x<arr.length ; x++) {
if(maxLen < arr[x].length) {
maxLen = arr[x].length;
}
}
System.out.println(maxLen);
for (int n = 0;n < maxLen;n++)
System.out.println(Arrays.toString(arr[n]));
int[] min = new int[maxLen];
for(int i = 0 ; i <maxLen ; i++) {
int temp = Integer.MAX_VALUE;
for(int j = 0 ; j <arr.length ; j++) {
if(i<arr[j].length){
if (arr[j][i] < temp)
temp = arr[j][i];
}
min[i] = temp;
}
}
System.out.print("每列中最小的数为:"+Arrays.toString(min));
}
}