连续子数组的最大和

class Solution:
    def FindGreatestSumOfSubArray(self, array):
        # write code here
        maxSum = None
        for i in range(len(array)):
            sum = 0
            for j in range(i, len(array)):
                sum += array[j]
                if sum > maxSum:
                    maxSum = sum
        return maxSum

class Solution:
    def FindGreatestSumOfSubArray(self, array):
        # write code here
        maxNum = None
        tmpNum = 0
        for i in array:
            if maxNum == None:
                maxNum = i
            if tmpNum + i < i:
                tmpNum = i
            else:
                tmpNum += i
            if maxNum < tmpNum:
                maxNum = tmpNum
        return maxNum