I have a list of numbers, and I'm trying to do the following in a way as efficient as possible.

For each consecutively incrementing chunk in the list I have to reverse its order.

This is my attempt so far:

l = []
l_ = []
i = 0
while i <= len(a)-1:if a[i] < a[i+1]:l_= l_ + [a[i]]else:l = l_ + [a[i]]l_ = []i = i + 1

I'd appreciate any guidance or other approaches.

So, for the following list:

a = [1,5,7,3,2,5,4,45,1,5,10,12]

I would like to obtain:

[7,5,1,3,5,2,45,4,12,10,5,1]     

Try this:

(with fixes from @Scott Boston and @myrmica)

nums = [1, 3, 5, 4, 6, 8, 9, 7, 2, 4] # sample input
chunk = []    # keep track of chunks
output = []   # output list
for i in nums:if chunk and i < chunk[-1]:output.extend(chunk[::-1]) # add reversed chunk to outputchunk[:] = [i]       # clear chunkelse:chunk.append(i)      # add to chunk
output.extend(chunk[::-1])   # empty leftover chunk
print(output)