codility MaxDoubleSliceSum

最新推荐文章于 2019-08-28 15:59:34 发布

原创最新推荐文章于 2019-08-28 15:59:34 发布 · 447 阅读

0 ·

CC 4.0 BY-SA版权

python 同时被 2 个专栏收录

62 篇文章

订阅专栏

codility

44 篇文章

订阅专栏

本文提供了一个解决Codility课程中MaxDoubleSliceSum问题的Python实现方案。通过迭代数组并使用动态规划思想来寻找最大双切片和。

Question:codility Lesson9 MaxDoubleSliceSum

My Answer:

def solution(A):
    lenA = len(A)
    maxdoublesum = 0
    maxslice = 0
    maxcur = 0
    minele = A[1] if A[1] > 0 else 0

    for i in range(2,lenA - 1):
        if A[i] <= minele:
            maxslice = maxslice + minele
            minele = A[i]
        else:
            maxslice = maxslice + A[i]

        if maxslice <= maxcur:
            maxslice = maxcur
            minele = A[i]
        maxcur = max(0,maxcur + A[i])
        maxdoublesum = max(maxdoublesum,maxslice)
    return maxdoublesum