CS110 3.1 Preclass code

increment_maxsubarray.py

def increment_max(lst, prevmax):
    currentmax = prevmax
    for i in range(len(lst)):
        if sum(lst[i:len(lst)]) > currentmax:
            currentmax = sum(lst[i:len(lst)])
    return currentmax

###test####
sho = [-2,-3,4,-1,-2,1,5,-2]    #max subarray has sum 7 at sho[2:6]
increment_max(sho, 7)

sho1 = [-2,-3,4,-1,-2,1,5,-2,-1]   #new item but max subarray is still 7 at sho1[2:6]
increment_max(sho1, 7)      #the function only returns the old subarray sum because the new one doesn't change anything

sho2 = [-2,-3,4,-1,-2,1,5,-2,3]   #new item now makes the max subarray at sho2[2:8] with sum 8
increment_max(sho2, 7)    #confirm that the function this time returns the new subarray sum