【leetcode】Search for a Range

Given a sorted array of integers, 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) {
        int len=nums.size();
        vector<int> res;
        int flag=0;
        for(int i=0;i<len;i++)
        {
            if(target==nums[i])
            {
                res.push_back(i);
                flag=1;
                break;
            }
        }

        if(flag==0)
        {
            res.push_back(-1);
        }
        flag=0;
        for(int i=len-1;i>=0;i--)
        {
            if(target==nums[i])
            {
                res.push_back(i);
                flag=1;
                break;
            }
        }
        if(flag==0)
        {
            res.push_back(-1);
        }


        return res;
    }
};