leetcode.152. Maximum Product Subarray

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.

class Solution {
public:
    int maxProduct(vector<int>& nums) {
        if( nums.size()==0) 
            return 0;  
        if(nums.size() == 1)
            return nums[0];  
  
        int global = nums[0];  
        int max_local = nums[0], min_local = nums[0];  
        for(int i=1; i<nums.size(); i++) {  
            int a = max_local*nums[i];  
            int b = min_local*nums[i];  
              
            max_local = max(nums[i], max(a, b));  
            min_local = min(nums[i], min(a, b));  
            global = max(max_local, global);  
        }  
          
        return global;  
    }
};