JavaSE-5.4【案例：数组遍历、数组最值】

package day5;

/**
 * @author haifei
 *
 * 案例：数组遍历、数组最值
 *
 */

public class demo4 {
    public static void main(String[] args) {
        printArr();
        getMaxMin();
    }

    public static void printArr(){
        int[] arr = {11, 22, 33, 44, 55};
        doPrintArr(arr);
    }

    public static void doPrintArr(int[] arr){
        System.out.print("[");
        for(int i=0; i<arr.length; i++){
            if(i == arr.length-1){
                System.out.print(arr[i]);
            }else {
                System.out.print(arr[i] + ", ");
            }
        }
        System.out.println("]");
    }

    public static void getMaxMin(){
        int[] arr = {12, 45, 3, 477, 69};
        int[] result = findMaxMin(arr);
        System.out.println("max=" + result[0]);
        System.out.println("min=" + result[1]);
    }

    public static int[] findMaxMin(int[] arr){
        int max = arr[0];
        int min = arr[0];

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

        int[] resultArr = {max, min};
        return resultArr;
    }

}