题目描述：
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.
题目大意：
从数组（至少包含一个数字）中找出一个连续的子数组，该子数组的乘积最大。
解题思路：
简单动态规划： ...