leetcode 34 Find First and Last Position of Element in Sorted Array C++

最新推荐文章于 2022-02-20 18:45:41 发布

Nahhhhhhhhhh

最新推荐文章于 2022-02-20 18:45:41 发布

阅读量159

点赞数

分类专栏：编程题算法题查找

本文链接：https://blog.csdn.net/sunnanhunan/article/details/83352301

版权

编程题同时被 3 个专栏收录

30 篇文章 0 订阅

订阅专栏

算法题

29 篇文章 0 订阅

订阅专栏

查找

4 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int right(vector<int>& nums, int target){
        int begin=0;
        int end=nums.size()-1;
        while(begin<=end){
            int mid=(begin+end)/2;
            if(target==nums[mid]){
                if(mid==nums.size()-1||nums[mid+1]>target){
                    return mid;
                }
                begin=mid+1;
            }
                else if(target<nums[mid])
                    end=mid-1;
                else if(target>nums[mid])
                    begin=mid+1;
            }
        return -1;
        }
    int left(vector<int>& nums, int target){
        int begin=0;
        int end=nums.size()-1;
        while(begin<=end){
            int mid=(begin+end)/2;
            if(target==nums[mid]){
                if(mid==0||nums[mid-1]<target){
                    return mid;
                }
                end=mid-1;
            }
                else if(target<nums[mid])
                    end=mid-1;
                else if(target>nums[mid])
                    begin=mid+1;
            }
        return -1;
        }
    
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int>result;
        result.push_back(left(nums,target));
        result.push_back(right(nums,target));
        return result;
    }
    
};