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) {
        int n = nums.length;
        int max_temp = nums[0];
        int min_temp = nums[0];
        int result = nums[0];
        
        for(int i=1;i<n;i++)
        {
            int a = nums[i]*max_temp;  // 分为两种情况，正的最大和负的最小
            int b = nums[i]*min_temp;
            max_temp = Math.max(Math.max(a,b),nums[i]);
            min_temp = Math.min(Math.min(a,b),nums[i]);
            result = Math.max(max_temp,result);
        }
        return result;
    }
}