题目: 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. 提示: 这道题可以使用动态规划求解,但是由于是乘法运算,所以情况更加复杂.…