科目一刷题01 二分查找

zhranjie

已于 2024-07-06 11:30:29 修改

阅读量98

点赞数 1

分类专栏：刷题日记文章标签：算法 leetcode 数据结构

于 2024-06-02 21:42:46 首次发布

本文链接：https://blog.csdn.net/zhranjie/article/details/139397920

版权

刷题日记专栏收录该内容

6 篇文章 0 订阅

订阅专栏

704. 二分查找

方法一左闭右开

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

方法二左闭右闭

int search(vector<int>& nums, int target)
 {
        int left = 0;
        int right = nums.size()-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{
                right = mid-1;
            }
        }
        return -1;
    }