Leetcode—— 在排序数组中查找元素的第一个和最后一个位置

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
         vector<int>res;
        bool flag  = binary_search(nums.begin(),nums.end(),target);
        if(flag)
        {
            int temp1 = lower_bound(nums.begin(),nums.end(),target)-nums.begin();
        int temp2 = upper_bound(nums.begin(),nums.end(),target)-nums.begin();
        res.push_back(temp1);
            res.push_back(temp2-1);
            
        }
        else
        {
              res.push_back(-1);
            res.push_back(-1);
        }
           return res;
            
        
    }
};