package leetcode;

/**
 * https://leetcode.com/problems/binary-search/
 */
public class Problem704 {
    public int search(int[] nums, int target) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem704 prob = new Problem704();
    }
}

package leetcode;

/**
 * https://leetcode.com/problems/binary-search/
 */
public class Problem704 {
    public int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (nums[mid] < target) {
                left = mid + 1;
            } else if (nums[mid] > target) {
                right = mid - 1;
            } else {
                return mid;
            }
        }
        return -1;
    }
}

Solve problem 704