classSolution: """ @param nums: The integer array. @param target: Target to find. @return: The first position of target. Position starts from 0. """ defbinarySearch(self, nums, target): low = 0 high = len(nums) - 1 while low <= high: mid = low + (high - low) // 2 if nums[mid] == target: while(mid >= 0):#新增加的while和if用于解决有重复数字的情况,并保证每次都输出第一次出现的target的下标 if nums[mid] != target: break