子数组最大累加和 python

def FindGreatestSumOfSubArray(arr):
    if arr is None or len(arr) == 0:
        return

    cur = 0
    max_num = arr[0]

    for i in range(len(arr)):
        cur += list[i]
        if arr[i] < 0 and cur <= 0:
            cur = 0
        if cur > max_num:
           max_num = cur

    return  max_num

if   __name__ =="__main__":
    list = [1,-2,3,5,-2,6,-1]
    print(FindGreatestSumOfSubArray(list))