leetcode

0 class Solution {

1 public:

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

3 int a = max(nums[0], nums[1]);

4 int b = min(nums[0], nums[1]);

5 for (int i = 2; i < nums.size(); i++) {

6 if (nums[i] > a) {

7 b = a;

8 a = nums[i];

9 } else {

10 b = max(b, nums[i]);

11 }

12 }

13 return (a - 1) * (b - 1);

14 }

15 };