题解 | #二分查找-I#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param nums int整型一维数组
     * @param target int整型
     * @return int整型
     */
    public int search (int[] nums, int target) {
        if(nums.length == 0)
    		return -1;
        return result(0, nums.length, nums, target);
        //System.out.println(result(0, nums.length, nums, target));
        //return 0;
    }

    public int result(int left, int right, int[] nums, int target) {
        if (left >= right) {
            return -1;
        }
        int mid = (left + right) / 2;
        if (target > nums[mid]) {
            return result(mid + 1, right, nums, target);
        } else if (target < nums[mid]) {
            return result(left, mid, nums, target);
        } else {
            return mid;
        }
    }
}