乘积最大子序列

[2,3,-2,4]

[2,3]

6

class Solution {
public:
/**
* @param nums: a vector of integers
* @return: an integer
*/
int maxProduct(vector<int>& nums) {
// write your code here
int n = nums.size();
if (n < 1)
{
return 0;
}

int maxV
;
int minV
;
maxV[0] = nums[0];
minV[0] = nums[0];
int result = nums[0];
for (int i = 1; i < n; i++)
{
int a = nums[i] * maxV[i-1];
int b = nums[i] * minV[i-1];
maxV[i] = max(nums[i], max(a, b));
minV[i] = min(nums[i], min(a, b));
if (maxV[i] > result)
{
result = maxV[i];
}
}

return result;
}
};