Find the Longest Valid Obstacle Course at Each Position LeetCode solution in Python

1
from bisect import bisect_right
2

3

4
class Solution:
5
    def longestObstacleCourseAtEachPosition(self, obstacles: List[int]) -> List[int]:
6
        longest, res = [], []
7
        for i in range(len(obstacles)):
8
            idx = bisect_right(longest, obstacles[i])
9
            if idx == len(longest):
10
                longest.append(obstacles[i])
11
            else:
12
                longest[idx] = obstacles[i]
13
            res.append(idx + 1)
14
        return res