sol.java

public class Solution{
    public static void main(String[] args) {
        Solution1 test;
        test = new Solution1();
        System.out.println(test);

    }
}

class Solution1 {
    public int search(int[] nums, int target) {
        if (nums.length == 0) {
            return -1;
        }

        int left = 0;
        int right = nums.length - 1;

        System.out.println(right);

        while (left <= right) {
            int midpoint = (left + right) / 2;
            if (nums[midpoint] == target) {
                return midpoint;
            } else if (nums[midpoint] > target) {
                right = midpoint - 1;
            } else {
                left = midpoint + 1;
            }

        }
        return -1;
    }
}