蓝桥杯·数列特征·Java实现

import java.util.Scanner;

public class Main  {

    public  static  void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int numbers = sc.nextInt();
        int[] baseNum = new int[numbers];
        for (int i = 0;i<numbers;i++){
            baseNum[i]=sc.nextInt();
        }
        int numMax = baseNum[0];
        int numMin = baseNum[0];
        int sum = 0;
        for(int i=0;i<numbers;i++){
            if (numMax<baseNum[i]){
                numMax = baseNum[i];
            }
            if (numMin>baseNum[i]){
                numMin = baseNum[i];
            }
            sum += baseNum[i];
        }
        System.out.println(numMax);
        System.out.println(numMin);
        System.out.println(sum);
    }
}