How to find numbers in a sorted array
In this issue, the editor will bring you about how to find numbers in the sorted array. The article is rich in content and analyzes and narrates it from a professional point of view. I hope you can get something after reading this article.
Title:
Count the number of times a number appears in a sorted array. For example, the input sorted array {1, 2, 3, 3, 3, 3, 3, 4, 5}, because 3 appears four times in this number, the output is 4. 5.
#-*-coding: utf-8-*-# @ Time: 2019-07-13 15 Time @ Author: Jayce Wong# @ ProjectName: job# @ FileName: getNumberOfK.py# @ Blog: Blog @ Github: https://github.com/SysuJaycedef getFirstK (data, k): start, end = 0 Len (data)-1 while start > 1 if data [mid] = = k: # key is If mid is k, then determine whether the previous element is also k. If so, it means that this location is not the first time # appears, and continue to search on the left. Otherwise, return mid directly because it is the first time that if mid-1 > = start and data [mid-1] = = k: end = mid-1 else: return mid elif data [mid]
< k: start = mid + 1 else: end = mid - 1 return -1def getLastK(data, k): start, end = 0, len(data) - 1 while start >1 if data [mid] = = k: if mid + 1
