在排序数组中查找元素的第一个和最后一个位置(leetcode34)

输入：nums = [5,7,7,8,8,10], target = 8
输出：[3,4]

public class leetcode34 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub

        int[] nums = new int[]{5,7,7,8,8,10};
        int target = 8;
        
        int[] result = searchRange(nums,target);
        System.out.println(result[0]+","+result[1]);
    }
    
    public static int[] searchRange(int[] nums, int target) {

        int leftIdx = searchBinary(nums,target,true);
        int rightIdx = searchBinary(nums,target,false)-1;
        if(rightIdx<nums.length&&leftIdx>=0&&leftIdx<=rightIdx&&nums[leftIdx]==target&&nums[rightIdx]==target){
            return new int[]{leftIdx,rightIdx};
        }
        return new int[]{-1,-1};
    }
    
    public static int searchBinary(int[] nums,int target,boolean lower){
        int ans = nums.length;
        int left = 0;
        int right = nums.length-1;
        while(left<=right){
            int mid = (left+right)/2;
            if(nums[mid]>target||(lower&&nums[mid]>=target)){
                right = mid-1;
                ans = mid;
            }else{
                left = mid+1;
            }
        }
        return ans;
    }

}