二分查找实现一个有序数组中的某个数，数组中可能存在重复的数，存在返回数组中最早出现的元素的下标

 

package com.emitea.codeexerise;

import java.util.Scanner;

public class BinaeryTest {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N=scanner.nextInt();
        int []arr=new int[N];
        for(int i=0;i<N;i++){
            arr[i]=scanner.nextInt();
        }
        int temp=scanner.nextInt();
        int[] range = searchRange(arr, temp);
        System.out.println(range[0]);
    }

    private  static int []searchRange(int[]arr,int temp){
        int find=getBinarySearch(arr,temp);
        if(find==-1){
            return new int[]{-1,-1};
        }
        int left=find-1;
        int right=find+1;
        while(left>=0&&arr[left]==temp){
            left--;
        }
        while(right<arr.length&&arr[right]==temp){
            right++;
        }
        return new int[]{left+1,right-1};
    }

    private static int  getBinarySearch(int[] arr, int temp) {
        int low=0;
        int high=arr.length-1;
        while(low<=high){
            int mid=low+(high-low)/2;
            int midVal=arr[mid];
            if(midVal<temp){
                low=mid+1;
            }else if(midVal>temp){
                high=mid-1;
            }else {
                return mid;
            }
        }
        return -1;
    }
}