leetcode 34. 在排序数组中查找元素的第一个和最后一个位置

class Solution {
    public int[] searchRange(int[] nums, int target) {
        int targetIndex = searchTarget(nums,target);
        if(targetIndex < 0)
            return new int[]{-1,-1};
        int start = targetIndex,end = targetIndex;
        while(start > 0 && nums[start-1] == target)
            start--;
        while(end < nums.length-1 && nums[end+1] == target)
            end++;

        return new int[]{start,end};
    }

    public int searchTarget(int[] nums,int target){
        int start = 0,end = nums.length-1;
        while(start <= end){
            int mid = (start + end) / 2;
            if(nums[mid] == target)
                return mid;
            else if(nums[mid] > target)
                end = mid - 1;
            else
                start = mid + 1;
        }
        return -1;
    }
}