LeetCode 704 : Binary Search

https://leetcode.com/problems/binary-search/

Binary Search - LeetCode

 

간단한 이진 탐색 문제였습니다.

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int l = 0, r = nums.size() - 1;
        while(l <= r) {
            int m = (l + r) / 2;
            if(nums[m] == target) return m;
            else if(nums[m] > target) r = m - 1;
            else l = m + 1;
        }
        return -1;
    }
};