[15天速刷算法]DAY1-二分查找

勉力待乘风

于 2022-06-19 22:24:22 发布

阅读量67

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/qq_38239867/article/details/125363291

版权

题1：704. 二分查找

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

题2：278. 第一个错误的版本

class Solution {
public:
    int firstBadVersion(int n) {
        int st = 0;
        int ed = n - 1;
        int mid = (st+ed)/2;
        while(st<=ed){            
            if(isBadVersion(mid)){
                break;
            }else{
                st = mid + 1;
            }
            mid = st + (ed-st)/2;
        }
        while(isBadVersion(mid)){
            mid--;
        }
        return mid + 1;
    }
};

题3：

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