完美二分查找法【JAVA版】

最新推荐文章于 2022-04-09 09:41:32 发布

小马哥MAX

最新推荐文章于 2022-04-09 09:41:32 发布

阅读量215

点赞数

分类专栏：解题套路

本文链接：https://blog.csdn.net/majichen95/article/details/82191571

版权

解题套路专栏收录该内容

13 篇文章 0 订阅

订阅专栏

public int binarySearch(int[] nums, int target) {
        // write your code here
        if(target>nums[nums.length-1] || target<nums[0])
            return -1;
        
        int l = 0 , r = nums.length-1;
        int res = -1;
        
        while(l <= r){
            int mid = (r-l)/2+l;
            
            if(nums[mid] == target){
                res = mid;
                break;
            }
            else if(nums[mid] > target)
                r = mid-1;
            else
                l = mid+1;
 
        }

        return res;
    }

非递归版：

    public static int binarySearch(int[] nums , int target){
    	if(nums == null || nums.length <= 0)
    		return -1;
    	
    	if(target > nums[nums.length-1] || target < nums[0])
    		return -1;
    	
	return binarySearch(nums , target , 0 , nums.length-1);
    }
    
    public static int binarySearch(int[] nums , int target , int l , int r){
    	if(l > r)
    		return -1;
    	
    	int mid = (r-l)/2+l;
    	
    	if(nums[mid] == target)
    		return mid;
    	else if(nums[mid] < target)
    		return binarySearch(nums , target , mid+1 , r);
    	else
    		return binarySearch(nums , target , l , mid-1);  	
    }