LeetCode--628. 三个数的最大乘积(C++描述)

// Source : https://leetcode-cn.com/problems/maximum-product-of-three-numbers/submissions/
// Date : 2021-10-11

class Solution {
public:
    int maximumProduct(vector& nums) {
        //排序数组
        sort(nums.begin(), nums.end());
        int max1, max2;

        max1 = nums[nums.size() - 1] * nums[nums.size() - 2] * nums[nums.size() - 3];
        max2 = nums[nums.size() - 1] * nums[1] * nums[0];
        if(max1 > max2)
            return max1;  
        else
            return max2;
    }
};