Leetcode 34：Find First and Last Position of Element in Sorted Array

Given an array of integers nums 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].

Example 1:

Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4]
Example 2:

Input: nums = [5,7,7,8,8,10], target = 6
Output: [-1,-1]

C++
vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> res({-1,-1});
        int left = -1;
        int right = -1;
        for(int i = 0;i < nums.size();++i)
        {
            if(nums[i] == target)
            {
                left = i;
                int j = i;
                for(j = i;j < nums.size();++j)
                {
                    if(nums[j] != target)
                        break;
                }
                right = j - 1;
                res[0] = left;
                res[1] = right;
                return res;
            }
        }
        return res;
    }