首页 > 代码库 > [leetcode] Maximum Product Subarray @ python
[leetcode] Maximum Product Subarray @ python
[leetcode] Latest added: 2014-09-23
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.
Trick: Save Min value and Max value since the max value are only related with extrem value and current value
class Solution: # @param A, a list of integers # @return an integer def maxProduct(self, A): minTemp = maxTemp = MAX = A[0] for i in range(1, len(A)): Temp = [A[i], A[i] * minTemp, A[i] * maxTemp] minTemp, maxTemp = min(Temp), max(Temp) MAX = max(maxTemp,MAX) return MAX
[leetcode] Maximum Product Subarray @ python
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。