【leetcode】数组中两元素的最大乘积

 

int maxProduct(int* nums, int numsSize){
    int num1=0,num2=0,i;
    for(i=0; i<numsSize; i++)
    {
        if(nums[i] > num1)
        {
            num2 = num1;
            num1 = nums[i];
        }
        else if(nums[i] > num2) num2 = nums[i];
    }
    return (num1-1) * (num2-1);
}