【leetcode 简单】第十三题 最大子序和

class Solution:
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        max_value = nums[0]
        current =0
        for i in range(len(nums)):
            if current > 0: current +=nums[i]
            else:           current =  nums[i]
            if max_value < current:max_value = current
        return max_value