LeetCode刷题进阶之二分查找(704)

一、题目

演示示例：

二、测试代码

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

三、运行情况

传送门：Java编程之二分法查找(折半查找)