Seeking the maximum and minimum values in the array an algorithm subject per day, seeking the maximum and minimum array

An algorithm topic every day, seeking the maximum and minimum array

JAVA algorithm

This link: https://blog.csdn.net/liwei123liwei123/article/details/77880520

Expansion

Seeking a maximum and minimum values ​​in the array, in two ways:

public class MaxDemo {

    public static void main(String[] args) {
        int [] num ={123,43,435,46,57,68,78,7,98};
        int max = Max(num);
        int min = Min(num);
        System.out.println("最大数值是"+max);
        System.out.println("最大数值是"+min);
        Max_Min(num);
    }

    //求最大数
    public static int Max(int []num){
        int max = num[0];
        int length = num.length;
        for(int i = 1; i < length;i++){
            if(max < num[i]){
                num[i] = num[i]+max;
                max = num[i]- max;
                num[i] = num[i]- max;
            }
        }
        return max;
    }

    //求最小值
    public  static int Min(int [] num){
        int min = num[0];
        int length = num.length;
        for(int i = 1; i < length;i++){
            if(min > num[i]){
                num[i] = num[i]+min;
                min = num[i]-min;
                num[i] = num[i]-min;
            }
        }
        return min;
    }

    public static void  Max_Min(int []num ){
        int min =  num[0],max = num[0];
        int length = num.length;
        for(int i = 0; i < length;i++){
            if(max > num[i]){
                max=num[i];
            }
            if(min < num[i]){
                min=num[i];
            }
        }
        System.out.println("最大数值是"+max);
        System.out.println("最大数值是"+min);
    }


}
  
  

Personally prefer the second way, is relatively simple.

Seeking a maximum and minimum values ​​in the array, in two ways: