Search for a Range

Search for a Range

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

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].

解析：

先二分查找左边界，再二分查找右边界

代码：

class Solution {
public:

    int findpos(vector<int>&nums, int target,int isleft)
    {
        int left=0;
        int right=nums.size()-1;
        
        while(left<=right)
        {
            int mid=(left+right)>>1;
            if (nums[mid]==target)
            {
                if (isleft)
                {
                    if (mid==0||nums[mid-1]<nums[mid])
                    return mid;
                    right=mid-1;
                }
                else
                {
                    if (mid==(nums.size()-1)||nums[mid+1]>nums[mid])
                    return mid;
                    left=mid+1;
                }
            }
            else if (nums[mid]>target)
            {
                right=mid-1;
            }
            else
            {
                left=mid+1;
            }
            
        }
        
        
        return -1;
        
    }



    vector<int> searchRange(vector<int>& nums, int target) {
        
        vector<int>ans;
        ans.push_back(findpos(nums,target,1));
        ans.push_back(findpos(nums,target,0));
        return ans;
        
        
        
    }
};