求最大值和最小值，以及它们在数组中出现的次数。找出最大值首先出现和最小值最后出现的位置

Question

    import java.util.Arrays;
import java.util.Scanner;

public class A8HW1{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        System.out.print("Enter array length: ");
        int size = sc.nextInt();
        
        int [] array = new int[size];
        
        for(int i = 0; i < size; i++)
              array[i] = (int) (Math.random() * ((100 - 0) + 1)) + 0;
        
        System.out.println( "\n" +Arrays.toString(array));
        
        Max_Or_Min(array);
    }
    
    public static void Max_Or_Min(int [] array)
    {
        if(array.length == 1)
        {
             System.out.println("Min = " + array[0]);
             System.out.println("Max = " + array[0]);
        }
        else
        {
           int Max,Min = 0;
        
           if(array[0] > array[1])
             {
               Min =  array[1];
               Max =  array[0];
             }
           else
             {
               Min = array[0];
               Max = array[1];
             }
        
            for(int i = 2; i < array.length; i++)
               {
                  if(array[i] > Max)
                  Max = array[i];
            
                  else if(array[i] < Min)
                  Min = array[i];
        }
        
            System.out.println("Max = " + Max);
            System.out.println("Min = " + Min);
            
            Occurrence(array, Max, Min);
       }
    }
    
    public static void Occurrence(int [] array, int Max, int Min)
    {
        int count = 0,times = 0, Min_idx = 0;
        for(int i = 0; i < array.length; i++)
        {
            if(array[i] == Max)
            {
                count++;
            }
            if(array[i] == Min)
            {
                times++;
                Min_idx = i;
            }
        }
        System.out.println("\nFirst Maximum Occurred on position = ");
        System.out.println("Last Minimum Occurred on position = " + (Min_idx + 1));
        
        String x = (count > 1) ? "times." : "time.";
        System.out.println("Maximum Occurred = " + count + " " + x);
        
        String y = (times > 1) ? "times." : "time.";
        System.out.println("Minimum Occurred = " + times + " " + y);
    }
    
}

Answer 1

在你的答案中，你在数组中循环了两次。你实际上可以避免。

这里，我重新编写了max_or_min方法。还请注意，您不再需要concertion方法。

public static void Max_Or_Min(int [] array) {
    int min = Integer.MAX_VALUE;
    int max = Integer.MIN_VALUE;

    int min_count = 1;
    int max_count = 1;

    int max_first_occurs = -1;
    int min_last_occurs = -1;

    int i = 0;

    for (int x: array) {
        if (x > max) { max = x; max_count = 1; max_first_occurs = i; }
        else if (x == max) { max_count++; }

        if (x < min) { min = x; min_count = 1; min_last_occurs = i; }
        else if (x == min) { min_count++; min_last_occurs = i; }

        i ++;
    }

    System.out.println("Max: " + max);
    System.out.println("Min: " + min);

    System.out.println("Max count: " + max_count);
    System.out.println("Min count: " + min_count);

    System.out.println("Max first occurs at: " + max_first_occurs);
    System.out.println("Min last occurs at: " + min_last_occurs);
}

注意:max_first_occurs和min_last_occurs索引表示数组中的位置，通常以0开始