Leetcode之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 larges

>>阅读原文<<