628 https://leetcode-cn.com/problems/maximum-product-of-three-numbers/

qq_34673038

于 2019-05-28 01:08:42 发布

阅读量364

点赞数

CC 4.0 BY-SA版权

分类专栏：算法基础

本文链接：https://blog.csdn.net/qq_34673038/article/details/90617931

算法基础专栏收录该内容

33 篇文章

订阅专栏

博客围绕LeetCode 628题，该题网址为https://leetcode-cn.com/problems/maximum-product-of-three-numbers/ ，但具体题目内容及解题思路等关键信息缺失。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

class Solution {
public:
    int maximumProduct(vector<int>& nums) {
         int max1 = INT_MIN ,max2= INT_MIN, max3 = INT_MIN, min1 = INT_MAX, min2 = INT_MAX;
    for (int n : nums) {
        if (n > max1) {
            max3 = max2;
            max2 = max1;
            max1 = n;
        } else if (n > max2) {
            max3 = max2;
            max2 = n;
        } else if (n > max3) {
            max3 = n;
        }

        if (n < min1) {
            min2 = min1;
            min1 = n;
        } else if (n < min2) {
            min2 = n;
        }
    }
    return max(max1*max2*max3, max1*min1*min2);
    }
};