[Leetcode] Maximum Product Subarray @ Python

Original title address: https://oj.leetcode.com/problems/maximum-product-subarray/

Problem-solving ideas: The main need to consider negative negative is the case, such as the previous minimum is a negative, and then multiplied by a negative number may become a large positive.

Code:

classSolution:#@param A, a list of integers    #@return An integer    defmaxproduct (Self, A):ifLen (A) = =0:return0 min_tmp=A[0] Max_tmp=A[0] Result=A[0] forIinchRange (1, Len (a)): A= A[i] *min_tmp b= A[i] *max_tmp C=A[i] Max_tmp=Max (A, B), c) min_tmp=min (min (b), c) Result= Max_tmpifMax_tmp > ResultElseresultreturnresult

[Leetcode] Maximum Product Subarray @ Python