【LeetCode】二分查找

此号不用，请关注夜雨柠檬

于 2019-08-06 18:27:10 发布

阅读量93

点赞数

分类专栏： LeetCode 文章标签： LeetCode 查找

本文链接：https://blog.youkuaiyun.com/qq_37043100/article/details/98644173

版权

LeetCode 专栏收录该内容

13 篇文章

订阅专栏

Java code

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