[leetcode]Maximum Subarray @ Python

标签：style   class   blog   code   java   http   

原题地址：https://oj.leetcode.com/problems/maximum-subarray/

题意：

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [?2,1,?3,4,?1,2,1,?5,4],
the contiguous subarray [4,?1,2,1] has the largest sum = 6.

click to show more practice.

class Solution:
    # @param A, a list of integers
    # @return an integer
    def maxSubArray(self, A):
        ThisSum = 0
        MaxSum = -10000
        
        for i in range( 0, len(A) ):
            if ThisSum < 0:
                ThisSum = 0
            ThisSum = ThisSum + A[ i ]
            MaxSum = max( ThisSum, MaxSum )

        return MaxSum

 

[leetcode]Maximum Subarray @ Python,布布扣,bubuko.com

[leetcode]Maximum Subarray @ Python

标签：style   class   blog   code   java   http   

原文地址：http://www.cnblogs.com/zuoyuan/p/3781988.html