public static void main(String args[]){
        MaxProductSubarray mps = new MaxProductSubarray();
        int input[] = {-6, -3, 8, -9, -1, -1, 3, 6, 9, 0, 3, -1};
        System.out.println(mps.maxProduct(input));
    }
Date 04/`7/2016
@author Tushar Roy

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

Time complexity is O(n)
Space complexity is O(1)

http://www.geeksforgeeks.org/maximum-product-subarray/
https://leetcode.com/problems/maximum-product-subarray/
src/com/interview/array/MaxProductSubarray.java