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. 看到这道题,很明显的一套动态规划类型的题目,和最长升序子序列之类的十分类似,那么首先…