Maximum Product Difference Between Two Pairs LeetCode solution in Java

1
class Solution {
2
  public int maxProductDifference(int[] nums) {
3
    int max1 = Integer.MIN_VALUE;
4
    int max2 = max1;
5

6
    int min1 = Integer.MAX_VALUE;
7
    int min2 = min1;
8
    for (int i = 0; i < nums.length; i++) {
9
      if (max1 < nums[i]) {
10
        max2 = max1;
11
        max1 = nums[i];
12
      } else if (nums[i] > max2) max2 = nums[i];
13

14
      if (min1 > nums[i]) {
15
        min2 = min1;
16
        min1 = nums[i];
17
      } else if (nums[i] < min2) min2 = nums[i];
18
    }
19

20
    return (max1 * max2) - (min1 * min2);
21
  }
22
}