Title

the problem link

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: The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000]. Multiplication of any three numbers in the input won’t exceed the range of 32-bit signed integer.

找其中三个数，这三个数的乘积最大，返回这个最大乘积

Solution

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