August 10, 2015
有二种解法, Greedy算法, 和DP算法. 二种算法都通过leetcode online judge. 贪婪算法, 花了一个小时理解代码, 修改后很好理解.
Problem statement:
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.
Two approaches, one is dynamic programming DP implementation, another is the greedy method.
DP solution:
https://github.com/jianminchen/MaximumProductSubarray/blob/master/MaximumProductSubarray1.cs
Greedy algorithm:
https://github.com/jianminchen/MaximumProductSubarray/blob/master/MaximumProductSubarray2.cs