1464. 数组中两元素的最大乘积

class Solution {
public:
    int maxProduct(vector<int>& nums) 
    {
        int index1=0;
        int index2=1;
        for(int i=1;i<nums.size();i++)
        {
            if(nums[index1]<=nums[i])
            {
                index2=index1;
                index1=i;
            }
            else if(nums[index2]<=nums[i])
            {
                index2=i;
            }
        }
    return (nums[index1]-1)*(nums[index2]-1);
    }
};