image_2021-10-15_23-57-39.png
55.5 KB
#N1913 Maximum Product Difference Between Two Pairs
problem link=>https://leetcode.com/problems/maximum-product-difference-between-two-pairs/
#solution
problem link=>https://leetcode.com/problems/maximum-product-difference-between-two-pairs/
#solution
class Solution {
public int maxProductDifference(int[] nums) {
int largest = 0, largest2 = 0, smallest = Integer.MAX_VALUE, smallest2 = Integer.MAX_VALUE;
for(int i=0;i<nums.length;i++) {
if(nums[i]>=largest) {
largest2 = largest;
largest = nums[i];
} else if(nums[i]>largest2) largest2 = nums[i];
if(nums[i]<=smallest) {
smallest2 = smallest;
smallest = nums[i];
} else if(nums[i]<smallest2) smallest2 = nums[i];
}
return largest * largest2 - smallest * smallest2;
}
}