Page History

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> r={-1,-1};

        int n=nums.size();
        for(int i=0; i<n; i++) {
                if (r[0]<0) {
                        if (nums[i]==target) r[0]=r[1]=i;
                }
                else if (nums[i]!=target) break;
                else r[1]=i;
        }
        
        return r;
    }
};