Buildings With an Ocean View Python Solution

lcpy gen -n 1762   # by problem number
lcpy gen -s buildings_with_an_ocean_view   # by problem name

Input: heights = [4,2,3,1]
Output: [0,2,3]

Input: heights = [4,3,2,1]
Output: [0,1,2,3]

Input: heights = [1,3,2,4]
Output: [3]

class Solution:
    # Time: O(n)
    # Space: O(1) excluding the output list
    def find_buildings(self, heights: list[int]) -> list[int]:
        result: list[int] = []
        max_right = 0

        for i in range(len(heights) - 1, -1, -1):
            if heights[i] > max_right:
                result.append(i)
                max_right = heights[i]

        return result[::-1]