leetcode-704. 二分查找

最新推荐文章于 2024-10-20 21:47:19 发布

superkcl2022

最新推荐文章于 2024-10-20 21:47:19 发布

阅读量88

点赞数

分类专栏： # leetcode 文章标签： leetcode c++ java 算法

本文链接：https://blog.csdn.net/m0_37642480/article/details/116564192

版权

leetcode 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

文章目录

C++ binary_serarch()
C++ 手写二分
JAVA 手撕

C++ binary_serarch()

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int size = nums.size();
        //二分查找，查找成功返回1，查找失败返回0
        if(binary_search(nums.begin(),nums.end(),target) == 0) return -1;
        return lower_bound(nums.begin(),nums.end(),target)-nums.begin();
    }
};

C++ 手写二分

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

JAVA 手撕

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