算法分析与设计丨第十四周丨LeetCode（18）——Maximum Subarray（Medium）

题目描述：

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.

题目解析：

动态规划。也是一道比较经典的题目。不过是乘法且有正负，那么我们同时记录下当前的最小值与最大值，在最后的乘法计算中便可得出全局最大值。

class Solution {public:    int maxProduct(vector<int>& nums) {        if(nums.size() == 0)            return 0;        if(nums.size() == 1)            return nums[0];                int max_local = nums[0];        int min_local = nums[0];        int temp = 0;        int max_global = nums[0];        for(int i = 1;i < nums.size();++i)        {            temp = max_local;            max_local = max(max(nums[i],nums[i] * max_local),min_local * nums[i]);            min_local = min(min(nums[i],nums[i] * temp),min_local * nums[i]);            max_global = max(max_global,max_local);        }        return max_global;            }};