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].
二分查找
class Solution {
public:
int begin = -1, end = -1;
vector<int> searchRange(int A[], int n, int target) {
vector<int>ans;
find(A,0,n-1,target);
......
阅读全文