152. Product maximum subarray - dynamic programming

152. Product maximum subarray

Give you an array of integers nums , Please find the non empty continuous subarray with the largest product in the array （ The subarray contains at least one number ）, And returns the product of the subarray .

The answer to the test case is 32- position Integers .

Subarray Is a continuous subsequence of an array .

Example 1:

Input : nums = [2,3,-2,4]
Output : 6
explain : Subarray [2,3] There is a maximum product 6.

Example 2:

Input : nums = [-2,0,-1]
Output : 0
explain : The result can't be 2, because [-2,-1] It's not a subarray .

This question is very interesting , The solution code is as follows ：

int maxProduct(int* nums, int numsSize){
    
   int dp[numsSize+1][2];
    dp[1][0]=nums[0];
    dp[1][1]=nums[0];
    int maxt=dp[1][0];
    for(int i=2;i<=numsSize;i++){
    
        int max=nums[i-1]*dp[i-1][0];
        int min=nums[i-1]*dp[i-1][1];
        // printf("--min max %d %d",min, max);
        if(max<min){
    
            int t=min;
            min=max;
           max=t;
          
        }
       
        dp[i][0]=fmax(nums[i-1],max);
        if(dp[i][0]>maxt){
    
            maxt=dp[i][0];
        }
        dp[i][1]=fmin(nums[i-1],min);
       // printf("min max %d %d",dp[i][1], dp[i][0]);
        
    }
    return maxt;


}