class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
sort(nums.begin(),nums.end());
int len=nums.size();
int minn=len+1,maxn=-1;
for(int i=0;i<len;i++)
if(nums[i]==target){
minn=min(minn,i);
maxn=max(maxn,i);
}
vector<int>ans;
if(minn==len+1){
ans.push_back(-1);
ans.push_back(-1);
}
else{
ans.push_back(minn);
ans.push_back(maxn);
}
return ans;
}
};
未参考题解 最近较忙 以后再加注释