leetcode/problems/704-binary-search.cpp at main · Sa4dUs/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
// https://leetcode.com/problems/binary-search/description/

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int l = 0, r = size(nums) - 1;

        while (l <= r) {
            int m = (l + r)/2;

            if (target > nums[m]) {
                l = m + 1;
            } else if (target < nums[m]) {
                r = m - 1;
            } else {
                return m;
            }
        }

        return -1;
    }
};