-
Notifications
You must be signed in to change notification settings - Fork 0
/
maxProductDifference.java
80 lines (60 loc) · 2.33 KB
/
maxProductDifference.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
/**
The product difference between two pairs (a, b) and (c, d) is defined as (a * b) - (c * d).
For example, the product difference between (5, 6) and (2, 7) is (5 * 6) - (2 * 7) = 16.
Given an integer array nums, choose four distinct indices w, x, y, and z such that the product
difference between pairs (nums[w], nums[x]) and (nums[y], nums[z]) is maximized.
Return the maximum such product difference.
Example 1:
Input: nums = [5,6,2,7,4]
Output: 34
Explanation: We can choose indices 1 and 3 for the first pair (6, 7) and indices 2 and 4 for the
second pair (2, 4).
The product difference is (6 * 7) - (2 * 4) = 34.
Example 2:
Input: nums = [4,2,5,9,7,4,8]
Output: 64
Explanation: We can choose indices 3 and 6 for the first pair (9, 8) and indices 1 and 5 for the
second pair (2, 4).
The product difference is (9 * 8) - (2 * 4) = 64.
Constraints:
4 <= nums.length <= 104
1 <= nums[i] <= 104
*/
/*****************************************************************
1913. Maximum Product Difference Between Two Pairs
*****************************************************************/
public class maxProductDifference {
public static void main(String[] args) {
int[] nums = {4,2,5,9,7,4,8};
int numsLength = nums.length;
int largest = Integer.MIN_VALUE;
int secondLargest = largest;
for(int i=0; i<numsLength; i++) {
if(largest < nums[i]) {
int temp = largest;
largest = nums[i];
secondLargest = temp;
} else {
if(nums[i] <= largest && nums[i] >= secondLargest) {
secondLargest = nums[i];
}
}
}
int smallest = Integer.MAX_VALUE;
int secondSmallest = smallest;
for(int i=0; i<numsLength; i++) {
if(smallest > nums[i]) {
int temp = smallest;
smallest = nums[i];
secondSmallest = temp;
} else {
if(nums[i] <= secondSmallest && nums[i] >= smallest) {
secondSmallest = nums[i];
}
}
}
System.out.println("Maximum Pair Difference = " +
((largest * secondLargest) - (smallest * secondSmallest)));
// return (largest * secondLargest) - (smallest * secondSmallest);
}
}