题解 | #二分查找-II#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 如果目标值存在返回下标，否则返回 -1
     * @param nums int整型一维数组 
     * @param target int整型 
     * @return int整型
     */
    public int search (int[] nums, int target) {
        // write code here
        int num1 = find(nums,target);
        //int num2 = find(nums,target + 1);
        if(num1 == nums.length || nums[num1] != target){
            return  -1;
        }
        return num1;
    }
    public int find(int[] nums, int target){
        int r = nums.length;
        int l = 0;
        while(l < r){
            int mid = (l + r) >> 1;
            if(nums[mid] >= target){
                r = mid;
            }else{
                l = mid + 1;
            }
        }
        return l;
    }
}