Blogs Hub

by Sumit Chourasia | Nov 17, 2020 | Category :coding | Tags : algorithm array data-structure leetcode medium

Maximum Product Subarray - Array - Medium - LeetCode

Maximum Product Subarray - Array - Medium - LeetCode

Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.

Example 1:

Input: [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.
Example 2:

Input: [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.

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

Time Complexity: O(n)

Space Complexity: O(1)

Contributed By: Sumit Chourasia
Delete Duplicate Emails - SQL - Easy - LeetCode
Contributed By: Sumit Chourasia
Construct the Rectangle - Maths - Easy - LeetCode
Contributed By: Sumit Chourasia
Print in Order - Multi Threading - Easy - LeetCode