class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> ans(2);
        ans[0] = -1;
        ans[1] = -1;
        int left = 0;
        int right = nums.size()-1;
        while(left<=right)
        {
            if(nums[left] == target && ans[0] == -1)
            ans[0] = left;
            if(nums[left] != target)
            left++;
            if(nums[right] == target && ans[1] == -1)
            ans[1] = right;
            if(nums[right] != target)
            right--; 
            //left++;
            if(ans[0] != -1 && ans[1] != -1)
            break;
        }
        if(nums.size() == 1 && nums[0] == target)
        {
            ans[0] = 0;
            ans[1] = 0;
        }
        return ans;
    }
};