Найти сумму элементов массива между первым и последним положительными элементами

sum(data[1: -1])

data = [1, 1, 1, 1, 1, 1]
first, second = None, None
for i in range(len(data)):
    if first == None and data[i] > 0:
        first = i
    if second == None and data[-i - 1] > 0:
        second = -i - 1
    if first and second:
        break
print(sum(data[first + 1: second]) if first != None and second != None else 'не найдено достаточно положительных елементов')

(lambda a: (lambda b: print('Error' if len(b) < 2 else sum(a[b[0] + 1:b[-1]]))) ([i for i, j in enumerate(a) if j > 0])) (list(map(float, input().split())))

In [1]: def sumBetweenFirstAndLastPositiveElements(a):
    ...:     size = len(a)
    ...:     first = next((i for i, x in enumerate(a) if x > 0), 0)
    ...:     last = size - next((i for i, x in enumerate(reversed(a)) if x > 0), size)
    ...:     return sum(a[first:last])
    ...:
 
In [2]: assert sumBetweenFirstAndLastPositiveElements((1, 2, 3,)) == 6
 
In [3]: assert sumBetweenFirstAndLastPositiveElements((-1, -2, -3,)) == 0
 
In [4]: assert sumBetweenFirstAndLastPositiveElements((-1, 2, -3,)) == 2
 
In [5]: assert sumBetweenFirstAndLastPositiveElements((1, -2, 3,)) == 2
 
In [6]: assert sumBetweenFirstAndLastPositiveElements((1, -2, -3,)) == 1
 
In [7]: assert sumBetweenFirstAndLastPositiveElements((-1, -2, 3,)) == 3