华为机试---找出二维数组各维的最小值

package huawei;
/**
 * 	比较二维数组列最小值，组成一个新数组返回。
	(实现核心算法，不需要使用IO)
         输入：{{5,6,1,16},{7,3,9}} 
         输出：intArrs ={1,3}
         
 * @author USER
 *
 */
public class MinArray {
	public static void main(String[] args) {
		int[][] a = {{5,6,1,16},{7,3,9}};
		//System.out.println(a.length);
		int[] intArrs = findMin(a);
		for (int i = 0; i < intArrs.length; i++) {
			System.out.print(intArrs[i]+" ");
		}
	}

	private static int[] findMin(int[][] a) {
		// TODO Auto-generated method stub
		int[] arr = new int[a.length];
		for (int i = 0; i < a.length; i++) {
			int min = a[i][0];
			for (int j = 0; j < a[i].length; j++) {
				if (a[i][j] < min) {
					min = a[i][j];
				}
			}
			arr[i] = min;
		}
		return arr;
	}
}