做题日记领扣
线性枚举
添加链接描述1464
数组中两元素的最大乘积
class Solution {
public int maxProduct(int[] nums) {
if (nums.length <= 500&&nums.length>=2){
int max1 =0,max2 = 0;
for(int num:nums){
if(num>max1){
max2 = max1;
max1 = num;
}else if(num>max2){
max2 = num;
}
}
return (max1-1)*(max2-1);
} else{return -1;}
}
}