https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/
//也可以自己手写lower_bound upbound 以前写过
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
vector<int> res;
//upper_bound返回第一个>target的位置, lower_bound返回第一个>=target位置
int len=upper_bound(nums.begin(), nums.end(),target)-lower_bound(nums.begin(), nums.end(),target);
int fir=lower_bound(nums.begin(), nums.end(), target)-nums.begin();
if(len==1){
res.push_back(fir); res.push_back(fir);
return res;
}
else if(len==0){
res.push_back(-1); res.push_back(-1);
return res;
}
res.push_back(fir); res.push_back(fir+len-1);
return res;
}
};