[LeetCode] 704. Binary Search - Java

• 문제 링크

Binary Search - LeetCode

 

• 풀이 코드

public class Solution {

    public int search(int[] nums, int target) {
        int l = 0, r = nums.length - 1, i = -1;
        while (l <= r) {
            int m = l + (r - l) / 2;
            if (nums[m] >= target) {
                r = m - 1;
                i = m;
            } else l = m + 1;
        }

        return i != -1 && nums[i] == target ? i : -1;
    }

}