题解 | #二分查找-I#

二分查找-I

https://www.nowcoder.com/practice/d3df40bd23594118b57554129cadf47b

#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
# 
# @param nums int整型一维数组 
# @param target int整型 
# @return int整型
#
class Solution:
    def search(self , nums: List[int], target: int) -> int:
        if len(nums) == 0:
            return -1
        lenth_low = 0
        lenth_high = len(nums)-1
        lenth_half = (lenth_low+lenth_high)//2
        while lenth_low<=lenth_high:
            lenth_half = (lenth_low+lenth_high)//2
            if target == nums[lenth_half]:
                return lenth_half
            if target>nums[lenth_half]:
                lenth_low = lenth_half + 1
            if target<nums[lenth_half]:
                lenth_high = lenth_half -1
        
        return -1

全部评论

相关推荐

点赞 收藏 评论
分享
牛客网
牛客企业服务