首页 > 代码库 > LeetCode:Search for a Range
LeetCode:Search for a Range
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].
1 class Solution { 2 public: 3 vector<int> searchRange(int A[], int n, int target) { 4 vector<int> res={-1,-1}; 5 for(int i=0;i<n;i++) 6 { 7 if(target==A[i]) 8 { 9 res[0]=i;10 while(i+1<n&&target==A[i+1])11 i++;12 res[1]=i;13 break;14 }15 }16 return res;17 }18 };
LeetCode:Search for a Range
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。