Binary search (leetcode704. very simple and necessary)

Problem description ：

Given a n The elements are ordered （ Ascending ） integer array nums And a target value target  , Write a function search nums Medium target, If the target value has a return subscript , Otherwise return to -1.

Example ：
Example 1:

Input : nums = [-1,0,3,5,9,12], target = 9
Output : 4
explain : 9 Appear in the nums And the subscript is 4
Example 2:

Input : nums = [-1,0,3,5,9,12], target = 2
Output : -1
explain : 2 non-existent nums So back to -1

Code up , Take it to run ：

package com.onlyqi.test03.erfen;

/**
 * @author 
 * @date 2022/7/11 16:38
 * @description
 */
public class Test01 {
    public static void main(String[] args) {
        Integer[] array={1,4,7,9,22,66};
        System.out.println("============="+erFenTest(array,9));
    }
    public static Integer erFenTest(Integer[] array,Integer target){
        Integer start=0;
        Integer end=array.length-1;
      while (start<=end){
          Integer prov=(start+end)/2;
          if(array[prov]==target){
              return prov;
          }
          if(array[prov]>target){
              end=prov-1;
          }else {
              start=prov+1;
          }
      }
        return -1;
    }
}

I want to brush it 300 Algorithm questions , The first 102 Avenue