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;
        }
        if(nums.length == 1){
            return nums[0];
        }
        int max = nums[0], min = nums[0];
        int ret = max;
        
        for(int i = 1; i<nums.length; i++){
            int tempmax = max * nums[i];
            int tempmin = min * nums[i];
            max = Math.max(Math.max(tempmax, tempmin), nums[i]);
            min = Math.min(Math.min(tempmax, tempmin), nums[i]);
            ret = Math.max(ret, max);
        }
        return ret;
    }
}