LeetCode/solutions/cpp/0034.cpp at master · SnistAheads/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        int leftIndex = find(nums, target, true);
        if (leftIndex == nums.size() || nums[leftIndex] != target)
            return {-1, -1};

        return {leftIndex, find(nums, target, false) - 1};
    }

private:
    int find(vector<int>& nums, int target, bool isLeft) {
        int l = 0;
        int r = nums.size();

        while (l < r) {
            int m = (l + r) >> 1;
            if (target < nums[m] || (isLeft && target == nums[m]))
                r = m;
            else
                l = m + 1;
        }

        return l;
    }
};