Leetcode之二分思想

Posted 2023-02-02

友情提示: 代码在这里
本文参照该仓库学习,大家可以star

二分查找

原理

1. 正常实现

public class binarySearch 
    public int BinarySearch(int[] nums,int key)
        int l = 0,h = nums.length-1;
        while(l<=h)
        
            int m = (l+h)/2;
            if(nums[m] == key)
            
                return m;
             else if(nums[m]<key)
            
                l = m+1;
            else 
                h = m-1;
            
        
        return -1;