*152. Maximum Product Subarray

public class Solution {
    public int maxProduct(int[] nums) {
        if(nums == null || nums.length == 0)    return 0;
        
        int max_prev = nums[0];
        int min_prev = nums[0];
        int max_so_far = nums[0];
        int max_curr, min_curr;
        
        for(int i=1; i

你可能感兴趣的:(*152. Maximum Product Subarray)