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) { int numsSize = nums.size(); int res = 0; int preMin = 0; int preMax = 0; for(int i=0;i<numsSize;i++){ if(i == 0){ preMin = nums[0]; preMax = nums[0]; res = nums[0]; }else{ int tmp = preMax; preMax = max(preMin*nums[i],max(preMax*nums[i],nums[i])); preMin = min(preMin*nums[i],min(tmp*nums[i],nums[i])); res = max(preMax,res); } } return res; } };
原文：http://www.cnblogs.com/zengzy/p/5002477.html