[LeetCode] 34. Search for a Range

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

class Solution {public:    vector<int> searchRange(vector<int>& nums, int target) {        auto lo = lower_bound(nums.begin(), nums.end(), target);        auto hi = upper_bound(nums.begin(), nums.end(), target);        vector<int> res{-1, -1};        if (lo != hi) {            res[0] = lo - nums.begin();            res[1] = hi - nums.begin() - 1;        }        return res;    }};