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

思想：

由于要求时间复杂度为O（log n），且数组有序，所以采用二分法来解决该问题。注意边界值的处理。

代码：

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        int length = nums.size();
		int begin = 0;
		int end = length - 1;
		vector<int> ret;
		ret.push_back(-1);
		ret.push_back(-1);

		while (begin<=end)
		{
			int middle = (begin + end) >> 1;
			if (nums[middle]<target)
			{
				begin = middle+1;
			}
			else if (nums[middle]>target)
			{
				end = middle-1;
			}
			else
			{
				int b=middle;
				int e=middle;
				while (b > begin)
				{
					if (nums[--b] == target)
						continue;
					else
					{
						b++;
						break;
					}
						
				}
				while (e < end)
				{
					if (nums[++e] == target )
						continue;
					else
					{
						e--;
						break;
					}
						
				}
				
				ret.pop_back();
				ret.pop_back();
				if (e == b)
				{
					ret.push_back(e);
					ret.push_back(e);
				}
				else
				{
					ret.push_back(b);
					ret.push_back(e);
				}
				
				break;

			}
		}
		return ret;
    }
};

v