标签：style blog color io os ar for div sp
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 };
标签：style blog color io os ar for div sp
原文地址：http://www.cnblogs.com/levicode/p/3984705.html
