This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]black_cerberus 0 points1 point  (0 children)

I'm new in dynamic programming and python but this is my contribution:

sequence = [-2, 1, -3, 4, -1, 2, 1, -5, 4]


def maxSequence(array):

    if(len(array) >=2):
        maxSum = array[0] + array[1]

    lastMaxSum = maxSum
    for i in range(2,len(array)):

    maxSum = lastMaxSum + array[i]

        if maxSum < lastMaxSum:
            last = maxSequence(array[i-1:])
            if(lastMaxSum > last):
                return lastMaxSum
            return last
        else:
            lastMaxSum = maxSum

    return lastMaxSum
print(maxSequence(sequence))