152. Maximum Product Subarray LeetCode
2016-03-17 22:39
363 查看
题意：给一个数组，求最大连续字段积。
题解：这个跟最大连续子段和是一个套路，不过这里需要维护最大连续字段和和最小连续子段和，因为他们之间是互相转换的。
题解：这个跟最大连续子段和是一个套路，不过这里需要维护最大连续字段和和最小连续子段和，因为他们之间是互相转换的。
class Solution {
public:
int maxProduct(vector<int>& nums) {
int n = nums.size();
if(n == 0) return 0;
int local_min = nums[0],local_max = nums[0];
int maxn = nums[0];
for(int i = 1; i < n; i++)
{
int tmp = local_max;
local_max = max(nums[i],max(local_max * nums[i],local_min * nums[i]));
local_min = min(nums[i],min(local_min * nums[i],tmp * nums[i]));
maxn = max(maxn,local_max);
}
return maxn;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解