0%
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
| class Solution: def specialArray(self, nums: List[int]) -> int: left = 0 right = len(nums) def search_II(left,right): while left<=right: mid = (left+right)>>1 count = 0 for i in nums: if i >= mid : count += 1 if count == mid: return mid elif count > mid: return search_II(mid+1,right) else: return search_II(left,mid-1) return -1 return search_II(left,right)
|