34. 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].

tags: binary search

1） 二分搜索。

2） 题目中说已经排好序的整形数组。假如要搜索的整数是5，搜索时可以分别搜索出4.5和5.5的插入位置，这两个位置就是我们要求的结果。具体见代码：

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> res(2,-1);
        int p1 =  biSearch(nums, target-0.5);
        int p2 =  biSearch(nums, target+0.5) - 1;
        if(p1<=p2){
            res[0] = p1;
            res[1] = p2;
        }
        return res;
    }
    int biSearch(vector<int>& nums, float target){
        int s = 0, e = nums.size()-1, mid;
        while(s<=e){
            mid = (s+e)/2;
            if(nums[mid]<target)
                s = mid+1;
            if(nums[mid]>target)
                e = mid-1;
        }
        return s;
    }
};