LeetCode——034

/*
34. Search for a Range My Submissions QuestionEditorial Solution
Total Accepted: 80156 Total Submissions: 275867 Difficulty: Medium
Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm’s runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].

Subscribe to see which companies asked this question

*/

/*
解题思路：
使用STL的查找函数lower_bound(begin(),end(),target) 返回第一个大于等于target的指针，相同的upper_bound(begin(),end(),target)返回大于target的第一个元素的指针
*/

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {

         if(find(nums.begin(),nums.end(),target)==nums.end())return {-1,-1};

         int low= lower_bound(nums.begin(),nums.end(),target)-nums.begin();
         int up=upper_bound(nums.begin(),nums.end(),target)-nums.begin()-1;

         return vector<int> {low,up};

    }
};