leetcode/binary-search/main.cpp at main · milosz275/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
#include <bits/stdc++.h>

using namespace std;

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

int main()
{
    vector<int> nums = {1, 4, 62, 87, 321, 456, 890, 900, 2025};
    cout << Solution().search(nums, 62) << '\n'; // 2
    cout << Solution().search(nums, 321) << '\n'; // 4
    cout << Solution().search(nums, 890) << '\n'; // 6
    cout << Solution().search(nums, 2025) << '\n'; // 8
    return 0;
}