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
| #include <vector> #include <stdlib.h>
using namespace std;
int search(vector<int> &nums, int target) { int l = 0; int r = nums.size(); while (l < r) { int mid = l + ((r - l) >> 1); if (nums[mid] == target) return mid; if (nums[mid] < target) { l = mid + 1; } else { r = mid; } } return -1; }
|