Find Good Days to Rob the Bank LeetCode solution in Python

1
class Solution:
2
    def goodDaysToRobBank(self, security: List[int], time: int) -> List[int]:
3
        decreasing = [0] * len(security)
4
        increasing = [0] * len(security)
5
        for i in range(len(security)):
6
            if i > 0 and security[i - 1] >= security[i]:
7
                decreasing[i] = decreasing[i - 1] + 1
8
        for i in reversed(range(len(security))):
9
            if i < len(security) - 1 and security[i] <= security[i + 1]:
10
                increasing[i] = increasing[i + 1] + 1
11
        return [
12
            i
13
            for i in range(len(security))
14
            if increasing[i] >= time and decreasing[i] >= time
15
        ]