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

Solution：

class Solution {
public:
    int maximumProduct(vector<int>& nums) {
        std::sort(nums.begin(), nums.end());
        int a = nums[0]*nums[1]*nums[nums.size()-1];
        int b = nums[nums.size()-3]*nums[nums.size()-2]*nums[nums.size()-1];
        return max(a,b);
    }
};