#294 · #1966 · Binary Searchable Numbers in an Unsorted Array(未排序数组中的可二分查找数)

A binary searchable number in an array is one that would be found by the standard binary search procedure regardless of the search target. Given an array nums of distinct integers, return the number of binary searchable numbers. Constraints: 1 <= nums.length <= 10^5, 0 <= nums[i] <= 10^9, all elements are distinct.