My leetcode submissions.
stau.space
1#include <bits/stdc++.h>
2#include <ranges>
3namespace ra = std::ranges;
4namespace vi = std::ranges::views;
5using namespace std::string_literals;
6using namespace std;
7
8auto search(vector<int>& nums, int target) -> int
9{
10 auto const it = ra::lower_bound(nums, target);
11 return it != nums.end() && *it == target ? distance(nums.begin(), it) : -1;
12}
13
14auto main() -> int
15{
16 auto nums = vector{-1,0,3,5,9,12};
17 auto target = 9;
18 cout << search(nums, target) << endl;
19 nums = vector{-1,0,3,5,9,12};
20 target = 2;
21 cout << search(nums, target) << endl;
22 return 0;
23}
24