题解 | #二分查找-I#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型一维数组 
     * @param target int整型 
     * @return int整型
     */
    public int search (int[] nums, int target) {
        // write code here
        int first = 0, rear = nums.length;
        if(nums.length == 0){
            return -1;
        }
        while(first<=rear){
            int mid = (first+rear)/2;
            if(nums[mid] == target){
                return mid;
            }else if(target > nums[mid]){
                first = mid + 1;
            }else{
                rear = mid - 1;
            }
        }
        return -1;
    }
}