LeetCode[Dynamic Programming]: Maximum Product Subarray

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.

这类型题目适合用动态规划算法来做，由于存在负数的情况，所以不单要记录最大乘积，也要记录最小乘积。C++代码实现如下：

，酒般的思念，一饮就醉，醉时就用全部的热情读这忧伤的月色，