[Offoffoff] q38: number of times a number appears in an array

Unlike the half-lookup mode, the difference is that the upper and lower boundary of a fixed value is not found here.

Def getbounder (data, K, start, end, low_bound = false): If end <start: Return-1 while start <= end: Mid = (start + end)> 1if data [Mid]> K: End = mid-1 Elif data [Mid] <K: Start = Mid + 1 else: If low_bound = true: if mid = 0 or data [Mid-1]! = K: Return midelse: End = mid-1 else: If mid = end or data [Mid + 1]! = K: Return midelse: Start = Mid + 1def getnumberofk (data, k): If Len (data) <= 1: Return Len (data) low_bound = getbounder (data, K, 0, Len (data)-1, low_bound = true) up_bound = getbounder (data, K, 0, Len (data)-1, low_bound = false) return up_bound-low_bound + 1