Coding challenge: largest possible sum from consecutive numbers v2, Python 3

Language: Layout:

# Remove last element if negative from a list
def removeLastNegativeFromList(aList):
    for t in reversed(aList):
                if t > 0:
                    break
                else:
                    aList.remove(t) 
    return aList

def largestSummedConsecutiveSubArray(integer_list):
    running_sum = 0
    result_lists = []
    temp_list = []
    for integer in integer_list:
        running_sum = running_sum + integer
        if running_sum >= 0:
            temp_list.append(integer)   
        else:
            temp_list = removeLastNegativeFromList(temp_list)          
            result_lists.append(temp_list)
            temp_list = []
            running_sum = 0
     
    if len(temp_list) > 0:
        temp_list = removeLastNegativeFromList(temp_list)
        result_lists.append(temp_list)
    
    largest_summed_consecutive_subArray = []
    
    max_sum = 0
    for i in result_lists:
        if sum(i) > max_sum:
            max_sum = sum(i)
            largest_summed_consecutive_subArray = i
          
    return largest_summed_consecutive_subArray

#integer_list = []
#integer_list = [-1, -2, -5, -4, -5, -1, -2, -11]
#integer_list = [1, 2, 5, 4, 5, 1, 2, 11]
#integer_list = [1, 2, -5, 4, 5, -1, 2, -11]
#integer_list = [5,5,-3,-6]
#integer_list = [5,5,-5,-6]
integer_list = [5,5,-8,-6]

largest_summed_consecutive_subArray = largestSummedConsecutiveSubArray(integer_list)

print('For the original integer array of {}'.format(integer_list))
print('The largest summed consecutive sub array is {} with a sum of {}.'.format(largest_summed_consecutive_subArray, sum(largest_summed_consecutive_subArray)))

[ + ] Show input
Absolute running time: 0.14 sec, cpu time: 0.03 sec, memory peak: 6 Mb, absolute service time: 0,15 sec