LeetCoding Challenge Oct. 8: Binary Search

문제의 개요

생각

코드

class Solution {
    public int search(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while (left <= right) {
            int mid = (left + right) >>> 1;
            if (nums[mid] == target) {
                return mid;
            }

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