Maximum Product of Two Elements in an Array LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxProduct(vector<int> &nums) {
4
    int n = nums.size();
5
    sort(nums.begin(), nums.end());
6
    return (nums[n - 1] - 1) * (nums[n - 2] - 1);
7
  }
8
};