1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
| class Solution {
public:
int search(vector<int>& nums, int target) {
int n = nums.size(), l = 0, r = n - 1;
while (l <= r) {
int m = l + (r - l) / 2;
if (nums[m] == target) return m;
if (nums[m] < target) {
l = m + 1;
} else {
r = m - 1;
}
}
return -1;
}
};
|