leetcode

0 class Solution {

1 public:

2 int maxProductDifference(vector<int> &nums) const {

3 sort(begin(nums), begin(nums) + 4);

4 int a = nums[0], b = nums[1];

5 int c = nums[2], d = nums[3];

6 for (int i = 4; i < nums.size(); i++) {

7 if (nums[i] > d) {

8 c = d;

9 d = nums[i];

10 } else if (nums[i] > c) {

11 c = nums[i];

12 } else if (nums[i] < a) {

13 b = a;

14 a = nums[i];

15 } else if (nums[i] < b) {

16 b = nums[i];

17 }

18 }

19 return c * d - a * b;

20 }

21 };