LeetCode Search for a Range

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].

Solution:

class Solution {
public:
    vector<int> searchRange(int A[], int n, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> result;
        if(!binary_search(A,A+n,target)){
            result.assign(2,-1);
            return result;
        }
        int index=lower_bound(A,A+n,target)-A;
        int index1=upper_bound(A,A+n,target)-A;
        result.push_back(index);
        result.push_back(index1-1);
        return result;
    }
};