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

利用二分查找，并且返回次序。

这里有解题的思路

http://ask.julyedu.com/question/209

就是首先用二分法找到该元素，然后如果左右有相同的元素就将范围左右移动