java 实现二分查找

丫丫-lucy

于 2021-08-26 19:42:09 发布

阅读量100

点赞数

文章标签： java leetcode 算法

本文链接：https://blog.youkuaiyun.com/m386084855/article/details/119938897

版权

public int binarySearch(int[] nums, int target) {
    int left = 0;
    int right = nums.length - 1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] == target) {
            return mid;
        } else if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid - 1;
        }
    }
    return -1;

}