Number of Visible People in a Queue

lcpy gen -n 1944   # by problem number
lcpy gen -s number_of_visible_people_in_a_queue   # by problem name

Input: heights = [10,6,8,5,11,9]
Output: [3,1,2,1,1,0]

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

class Solution:
    # Time: O(n)
    # Space: O(n)
    def can_see_persons_count(self, heights: list[int]) -> list[int]:
        n = len(heights)
        answer = [0] * n
        stack: list[int] = []
        for i in range(n - 1, -1, -1):
            height = heights[i]
            while stack and stack[-1] < height:
                stack.pop()
                answer[i] += 1
            if stack:
                answer[i] += 1
            stack.append(height)
        return answer