29.连续子数组的最大和(python)

 1 # -*- coding:utf-8 -*-
 2 class Solution:
 3     def FindGreatestSumOfSubArray(self, array):
 4         # write code here
 5         MaxSum = array[0]
 6         PreSum = array[0]
 7         i = 1
 8         while i < len(array):
 9             PreSum = max(PreSum+array[i],array[i])
10             MaxSum = max(PreSum,MaxSum)
11             i+=1
12         return MaxSum