int maxProduct(vector<int> &nums) {
int maxNum = 0;
vector<int>::iterator iter;
for (auto it = nums.begin(); it != nums.end(); it++)
if (*it > maxNum)
maxNum = *it, iter = it;
nums.erase(iter);
int maxNum1 = 0;
for (auto it = nums.begin(); it != nums.end(); it++)
if (*it > maxNum1)
maxNum1 = *it, iter = it;
return (maxNum - 1) * (maxNum1 - 1);
}
1464. 数组中两元素的最大乘积
最新推荐文章于 2023-08-15 11:23:10 发布