class Solution:
def search(self, nums: List[int], target: int) -> int:
def helper(nums, target):
i, j = 0, len(nums)-1
while i <= j:
mid = (i + j) // 2
if target >= nums[mid]: i = mid + 1
else: j = mid - 1
return i
return helper(nums, target)-helper(nums, target-1)
'''
if not nums: return 0
i, j = 0, len(nums)-1
while i <= j:
mid = (i + j) // 2
if target >= nums[mid]:
i = mid + 1
else:
j = mid - 1
right = i
i, j = 0, len(nums)-1
while i <= j:
mid = (i + j) // 2
if target <= nums[mid]:
j = mid -+ 1
else:
i = mid + 1
left = j
return right-left-1
'''