题解 | #二分查找-I#

二分查找-I

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

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

                left = mid + 1
                print(left,'left值')
            else:
                right = mid - 1
                print(right,'right值')
        return -1


two = Solution()
nums = []
x = two.search(nums= nums,target=-1)
print(x)

#悬赏#
全部评论

相关推荐

点赞 评论 收藏
分享
HNU_fsq:建议直接出国,这简历太6了。自愧不如
点赞 评论 收藏
分享
点赞 收藏 评论
分享
牛客网
牛客企业服务