二分查找 leetcode704

分类: IT文章 • 2023-12-11 16:21:25

class Solution {
    public int search(int[] nums, int target) {
        int l=0;
        int r=nums.length-1;
        while(l<=r)
        {
            int mid=l+(r-l)/2;
            if(nums[mid]==target)
                return mid;
            if(nums[mid]>target)
            {
                r=mid-1;
            }
            else
                l=mid+1;
        }
        return -1;
    }
}