[leetcode]-628. Maximum Product of Three Numbers（C语言）

Given an integer array, find three numbers whose product is maximum and output the maximum product.

Example 1:

Input: [1,2,3]
Output: 6

 

Example 2:

Input: [1,2,3,4]
Output: 24

 

Note:

1. The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000].
2. Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.

void sort(int *nums,int l,int r)
{
    if(l>=r)
        return;
    int i=l,j=r;
    int k=nums[l];
    while(i<j)
    {
        while(i<j&&nums[j]>=k)
            j--;
        if(i<j)
        {
            nums[i]=nums[j];
            i++;
        }
        while(i<j&&nums[i]<k)
            i++;
        if(i<j)
        {
            nums[j]=nums[i];
            j--;
        }
    }
    nums[i]=k;
    sort(nums,l,i-1);
    sort(nums,i+1,r);
}
int maximumProduct(int* nums, int numsSize) {
    sort(nums,0,numsSize-1);
    int m1=nums[numsSize-1]*nums[numsSize-2]*nums[numsSize-3];
    int m2=nums[0]*nums[1]*nums[numsSize-1];
    return m1>m2?m1:m2;
}