把下面的代码改成python语言：public int searchint nums int target int left = 0 right = numslength - 1; whileleft = right int mid = left + right 2; ifnumsmid target
def search(nums, target): left = 0 right = len(nums) - 1 while left <= right: mid = (left + right) // 2 if nums[mid] < target: left = mid + 1 elif nums[mid] > target: right = mid - 1 else: return mid return -1
原文地址: http://www.cveoy.top/t/topic/bLwZ 著作权归作者所有。请勿转载和采集!