Stack. Return an array in descending order with previous integer greater than current

max_previous_number_array.py

"""https://www.algoexpert.io/questions/Sunset%20Views

Return an array in descending order given an array of positive non-zero integers either starting from left or right
"""

import functools

def sunsetViews(buildings, direction):
    n = len(buildings)
	def get_index(direction, n, idx):
		return idx if direction == "EAST" else n-1-idx
	get_index = functools.partial(get_index, direction, n)
	stack = []
	if not n: return stack
	iter_buildings = buildings
	if direction == "WEST":
		iter_buildings = reversed(buildings)
	# print(buildings)
	for idx, num in enumerate(iter_buildings):
		# print(stack, idx, num)
		while stack and num >= buildings[stack[-1]]:
			stack.pop()
		stack += [get_index(idx)]
	if direction == "WEST":
		return list(reversed(stack))
	return stack