题解 | #二分查找-I#

    public int search (int[] nums, int target) {
        if (nums == null || nums.length == 0) return -1;
        
        int mid = nums.length / 2;
        if (nums[mid] > target) {
            for (int i = 0; i <= mid; i++) {
                if(nums[i] == target) return i;
            }
        } else {
            for (int i = mid; i <= nums.length - 1; i++) {
                if(nums[i] == target) return i;
            }
        }
        return -1;
    }