152. Maximum Product Subarray

public class Solution {
    public int maxProduct(int[] nums) {
        if(nums.length==0) return 0;
        int min=nums[0],max=nums[0],res=nums[0];
        for(int i=1;i

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