152. Maximum Product Subarray dynamic programming

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

For example, given the array [2,3,-2,4],
the contiguous subarray [2,3] has the largest product = 6.

最大成绩可能是负数与负数的乘积或者正数与正数的乘积；

int maxProduct(vector<int>& nums) {
    if (nums.size() == 0)return 0;
    int posinum = nums[0];
    int neginum = nums[0];
    int sum = nums[0];
    for (int i = 1; i < nums.size(); i++){
        int tempposi = posinum;
        int tempnegi = neginum;
        posinum = max(nums[i], max(tempposi * nums[i], tempnegi * nums[i]));
        neginum = min(nums[i], min(tempposi * nums[i], tempnegi * nums[i]));
        sum = max(sum, posinum);
    }
    return sum;
}