leetcode刷题：最大子序积

1.题目
题解：






实现上面的过程

class Solution {
public:
    int maxProduct(vector<int>& nums) {

        int maxmium = nums[0];
        for (auto v : nums)
        {
            if (maxmium < v)
            maxmium = v;
        }

        int imax = 1, imin = 1;
        for(int i=0; i<nums.size(); i++){
            if(nums[i] < 0){ 
              int tmp = imax;
              imax = imin;
              imin = tmp;
            }
            imax = max(imax*nums[i], nums[i]);
            imin = min(imin*nums[i], nums[i]);
            
            maxmium = max(maxmium, imax);
        }
        return maxmium;

    }
};