628. Maximum Product of Three Numbers

最新推荐文章于 2023-12-26 13:13:16 发布

乐观的Zqq

最新推荐文章于 2023-12-26 13:13:16 发布

阅读量91

点赞数

分类专栏：【leetcode刷题日记】

本文链接：https://blog.csdn.net/qq_34326845/article/details/82941009

版权

【leetcode刷题日记】专栏收录该内容

40 篇文章 0 订阅

订阅专栏

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.

思路：首先排序之后，最大值出现的可能就三种:
1.最大三个正数
2.最小的两个负数和最大的证书
3.前三个

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

    }
};