題解 | #數(shù)字在升序數(shù)組中出現(xiàn)的次數(shù)#
數(shù)字在升序數(shù)組中出現(xiàn)的次數(shù)
http://fangfengwang8.cn/practice/70610bf967994b22bb1c26f9ae901fa2
import re # # 代碼中的類名、方法名、參數(shù)名已經(jīng)指定,請(qǐng)勿修改,直接返回方法規(guī)定的值即可 # # # @param nums int整型一維數(shù)組 # @param k int整型 # @return int整型 # class Solution: def GetNumberOfK(self , nums: List[int], k: int) -> int: # write code here len_num = len(nums) if len_num == 0: return 0 left = 0 right = len_num - 1 while(left < right): mid = (left+right)//2 if(nums[mid]>=k): right = mid else: left = mid+1 # 存在兩種例外情況,1:left>len_num-1 2: 找到的中間值不等于k if left>=len_num or nums[left]!=k: return 0 # 存一下左邊界 pos_left = left # 找右邊界,因?yàn)橐猯ogn 復(fù)雜度 # 重置一下條件 left = 0 right = len_num - 1 while(left<right): mid = (left+right+1)//2 if(nums[mid]<=k): left = mid else: right = mid-1 pos_right = left return pos_right - pos_left+1
劍指offer刷題筆記 文章被收錄于專欄
24秋招劍指offer刷題的筆記