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

一刷ac
解题思路：寻找第一次出现和最后一次出现目标值的索引并返回。

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

}