628. Maximum Product of Three Numbers

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].

1. Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.

题意：

给出一个数组，挑选三个数使其乘积最大，求这个最大乘积。

思路：

分类讨论。先排序，数组全大于等于0或者全小于等于0，就返回最大的三个值之积，否则最大值只可能在nums[n-1]*nums[n-2]*nums[n-3]和nums[n-1]*nums[0]*nums[1]这两个之间取。

代码：

class Solution {
public:
    int maximumProduct(vector<int>& nums) {
        if(nums.size()==3)
            return nums[0]*nums[1]*nums[2];
        else
        {
            sort(nums.begin(),nums.end());
            int n=nums.size();
            if(nums[n-1]<=0||nums[0]>=0)
                return nums[n-1]*nums[n-2]*nums[n-3];
            else if(nums[n-1]*nums[n-2]*nums[n-3]>=0&&nums[n-1]*nums[0]*nums[1]>=0)
                return nums[n-1]*nums[n-2]*nums[n-3]>nums[n-1]*nums[0]*nums[1]>0?nums[n-1]*nums[n-2]*nums[n-3]:nums[n-1]*nums[0]*nums[1];
        }
    }
};