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

根据模板： 模板：Binary Search - 二分搜索先找左边界，再找右边界，如果left+1 > right-1，即没有找到target，返回[-1, -1]；如果left+1 <= right-1，即找到了，返回[left+1, right-1]。代码如下：

public class Solution {
    public int[] searchRange(int[] nums, int target) {
        int[] res = {-1, -1};
        int left = -1, right = nums.length;
        while (left + 1 < right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] < target) {
                left = mid;
            } else {
                right = mid;
            }
        }
        int left2 = -1, right2 = nums.length;
        while (left2 + 1 < right2) {
            int mid = left2 + (right2 - left2) / 2;
            if (nums[mid] > target) {
                right2 = mid;
            } else {
                left2 = mid;
            }
        }
        if (left + 1 <= right2 - 1) {
            res[0] = left + 1;
            res[1] = right2 - 1;
        }
        return res;
    }
}