leetcode628+ array中取三个数乘积最大

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u013554860/article/details/82794397

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

class Solution {
public:
    int maximumProduct(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int len = nums.size();
        if(nums[len-1] < 0) return nums[len-1]*nums[len-2]*nums[len-3];
        int a =  nums[len-1]*nums[len-2]*nums[len-3];
        int b =  nums[len-1]*nums[0]*nums[1];
        return a>b? a:b;
    }
};