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].
2. Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.

这道题还是比较简单的，直接贴代码吧：）

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