首页 > 代码库 > 34. Search for a Range(C++)
34. Search for a Range(C++)
Given an array of integers sorted in ascending order, 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].
Solution:
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
vector<int> m_vec(2,-1);
bool s_flag=false,e_flag=false;
for(int i=0,j=nums.size()-1;i<=j;) {
if(nums[i]==target) {
m_vec[0]=i;
s_flag=true;
}else i++;
if(nums[j]==target){
m_vec[1]=j;
e_flag=true;
}else j--;
if(s_flag&&e_flag) break;
}
return m_vec;
}
};
34. Search for a Range(C++)
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。