1966. Binary Searchable Numbers in an Unsorted Array (Medium) - TengnanYao/daily_leetcode GitHub Wiki

class Solution:
    def binarySearchableNumbers(self, nums: List[int]) -> int:
        s = set()
        m = -inf
        for i, num in enumerate(nums):
            if num > m:
                s.add(i)
                m = num
        result = 0
        m = inf
        for i in range(len(nums) - 1, -1, -1):
            num = nums[i]
            if num < m:
                if i in s:
                    result += 1
                m = num
        return result