练习：数组和方法

将数组中为0的元素去掉，保存到新的数组中

求数组的和与数组中的最大值和最小值

package com.hiyo.Method;
//数组去掉为0的元素
public class OddToNewArr {
    public static void main(String[] args) {
        int oddArr[] = {1,3,4,5,0,0,6,6,0,5,4,7,6,7,0,5} ;
        int newlen = 0 ;
        for(int i=0; i<oddArr.length; i++) {
            if(oddArr[i] != 0)
              newlen++ ;
        }
        int  k = 0 ;
        int newArr[] = new int[newlen] ;
        for(int i=0; i<oddArr.length; i++) {
            if(oddArr[i] !=0 ) {
                newArr[k] = oddArr[i];
                k++ ;
            }
        }
        for(int j=0; j<newArr.length; j++) {
            System.out.print(newArr[j] + "\t");
        }
        System.out.println() ;
        System.out.println(oddArr.length);
        System.out.println(newArr.length);
        System.out.println("数组的和为：sum = " + sum(newArr));
        MaxMinMethod(newArr);
    }
    //求数组的和
    public static int sum(int[] x) {
        int sum = 0 ;
        for(int k=0; k<x.length; k++){
            sum = sum + x[k] ;
        }
        return sum ;
    }
    //求数组的最大值和最小值
    public static void MaxMinMethod(int[] x) {
        int max = x[0];
        int min = x[0] ;
        for(int i=0; i<x.length; i++) {
            if(x[i] < min)
                min = x[i] ;
            if(x[i] > max)
                max = x[i];
        }
        System.out.println("数组的最大值：" + max);
        System.out.println("数组的最小值：" + min );
    }
}