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.

 

public class Solution {
    public int MaxProduct(int[] nums) {
        if (nums.Length == 0) return 0;
        
        int max = nums[0], min = nums[0], result = nums[0];
        
        for (int i = 1; i < nums.Length; i++)
        {
            int tmax = max, tmin = min;
            max = Math.Max(nums[i], Math.Max(nums[i] * tmax, nums[i] * tmin));
            min = Math.Min(nums[i], Math.Min(nums[i] * tmax, nums[i] * tmin));
            
            result = Math.Max(result, max);
        }
        
        return result;
    }
}