[LeetCode By Python]53. 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.

代码＋调试：

class Solution(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        ThisSum = 0;MaxSum = nums[0]
        for i in range(len(nums)):
            if ThisSum<0:
                ThisSum = 0
            ThisSum += nums[i]
            MaxSum = max(ThisSum,MaxSum)
        return MaxSum

a = Solution()
print a.maxSubArray([-2])

上述算法复杂度为O(n),动态规划思想