Given integer array nums, find the subarray with the largest product and return the product.
Input: Integer array nums.
Output: Maximum product of any contiguous subarray.
Input: [2,3,-2,4]
Output: 6
Explanation: [2,3] has product 6.Input: [-2,0,-1]
Output: 0
Explanation: Best subarray is [0].Input: [-2,-3,-4]
Output: 12
Explanation: [-3,-4] gives 12.1<=nums.length<=2*10^4-10<=nums[i]<=10