题目位置 题目: 给一个数组,返回它的最大连续子序列的和。例如:{6,-3,-2,7,-15,1,2,2},连续子向量的最大和为8 思路:贪心算法 class Solution: def FindGreatestSumOfSubArray(self, array): # write code here if len(array) == 1: return array[0] cur = pos = array[0] for i in range(1,len(array)): pos = max(pos+array[i],array[i]) cur = max(cur,pos) return cur```