每日三题（6）

最新推荐文章于 2024-11-05 21:58:11 发布

翻身的咸鱼ing

最新推荐文章于 2024-11-05 21:58:11 发布

阅读量108

点赞数 1

分类专栏：每日刷题文章标签： leetcode 算法二分法

本文链接：https://blog.csdn.net/qq_43799957/article/details/105444415

版权

每日刷题专栏收录该内容

6 篇文章 0 订阅

订阅专栏

153. 寻找旋转排序数组中的最小值

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

744. 寻找比目标字母大的最小字母

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

Leetcode 35. 搜索插入位置

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        if(nums.empty()){  //此处要判空
            return 0;
        }
        int l = 0, r = nums.size() - 1, mid;
        while(l < r){
            mid = l + ((r - l)>>1);
            if(nums[mid] == target){
                return mid;
            }else if(nums[mid] < target){
                l = mid +1;
            }else{
                r = mid -1;
            }
        }
        if(nums[l] < target)  //注意
        return l + 1;
        return l;
    }
};