二分法递推写法

class Solution {
    public static void main(String[] args) {
        int[] num = {1,2, 3, 4, 5};
        System.out.println(new Solution().find(num, 0, 4, 9));
    }
    public int find(int[] num, int left, int right, int target){
        if(left == right){
            if(target == num[left]) return left;
            return -1;
        }
        int mid= (left + right)/2;
        if(num[mid] < target) return find(num, mid + 1, right, target);
        else if(num[mid] > target) return find(num, left, mid - 1, target);
        else return mid;
    }
}