第七章：二分搜索与贪婪-CSDN博客

本文链接：https://blog.csdn.net/matafeiyanll/article/details/115311745

二分搜索与贪婪

二分搜索

递归写法
在这里插入图片描述非递归写法

剑指 Offer 53 - I. 在排序数组中查找数字 I

统计一个数字在排序数组中出现的次数。

示例 1:

输入: nums = [5,7,7,8,8,10], target = 8
输出: 2

示例 2:

输入: nums = [5,7,7,8,8,10], target = 6
输出: 0

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