Maximum Product Of Three Numbers Problem
Description
LeetCode Problem 628.
Given an integer array nums, find three numbers whose product is maximum and return the maximum product.
Example 1:
1
2
Input: nums = [1,2,3]
Output: 6
Example 2:
1
2
Input: nums = [1,2,3,4]
Output: 24
Example 3:
1
2
Input: nums = [-1,-2,-3]
Output: -6
Constraints:
- 3 <= nums.length <=10^4
- -1000 <= nums[i] <= 1000
Sample C++ Code
1
2
3
4
5
6
7
8
class Solution {
public:
int maximumProduct(vector<int>& nums) {
int n = nums.size();
sort(nums.begin(), nums.end());
return max(nums[n - 1] * nums[n - 2] * nums[n - 3], nums[0] * nums[1] * nums[n - 1]);
}
};