152.乘积最大子序列 (Medium)*

class Solution {
public:
    int maxProduct(vector<int>& nums) {
        int len = nums.size();
        if(len == 0) {
            return 0;
        }else if(len == 1) {
            return nums[0];
        }
        int maxium = nums[0], minium = nums[0];
        int res = nums[0];
        for(int i = 1; i < len; i++) {
            int tmp = maxium;
            maxium = max(max(maxium * nums[i], nums[i]), minium * nums[i]);
            minium = min(min(minium * nums[i], nums[i]), tmp * nums[i]);
            res = max(maxium, res);
        }
        return res;
    }
};