java_2018_Day17_数组操作

    public static int qu_zuida(int x,int y){            //传递两个参数,返回最大值
        if(x>y){
            return x;
        }else{
            return y;
        }
    }
    public static int qu_zuixiao(int x,int y){            //传递两个参数,返回最小值
        if(x>y){
            return x;
        }else{
            return y;
        }
    }
    public static void bianli (int[] arr){                //数组遍历
        System.out.print("[");
        for(int x=0;x<arr.length;x++){
            if(x == arr.length-1){
                System.out.print(arr[x]+"]");
            }else{
                System.out.print(arr[x]+",");
            }
        }
        System.out.println();
    }
    public static void shuzunixu(int[] a){                //数组逆序
        bianli(a);
        for(int i=0;i<=a.length/2;i++){
            int s = a[i];
            a[i] = a[a.length-1-i];
            a[a.length-1-i] = s;
        }
        bianli(a);
    }