題目描述:
給一個數組,返回它的最大連續子序列的和
思路:
有個最優子結構性質:DP[i] = max{DP[i-1] + A[i],A[i]}。能第一眼看出還是有些本事。
代碼:
# -*- coding:utf-8 -*-
class Solution:
def FindGreatestSumOfSubArray(self, array):
# write code here
res =max(array)
temp = 0
for i in array:
temp = max(i,temp+i)
res = max(res,temp)
return res