Java 实现 3n/2-2 比较次数查找集合最大最小值 (迭代方法)

public class FindMaxAndMin { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int[] nums = new int[n]; for (int i = 0; i < n; i++) { nums[i] = scanner.nextInt(); } scanner.close();

    int max = Integer.MIN_VALUE;
    int min = Integer.MAX_VALUE;
    
    for (int i = 0; i < n; i += 2) {
        if (nums[i] < nums[i + 1]) {
            if (nums[i] < min) {
                min = nums[i];
            }
            if (nums[i + 1] > max) {
                max = nums[i + 1];
            }
        } else {
            if (nums[i + 1] < min) {
                min = nums[i + 1];
            }
            if (nums[i] > max) {
                max = nums[i];
            }
        }
    }
    
    System.out.println('Max: ' + max);
    System.out.println('Min: ' + min);
}

}