目录

题目

解法一：二分查找

---

题目

解法一：二分查找

int find(const int* nums, int size, int target)
{int left = 0, right = size - 1;while (left <= right){int mid = (left + right) / 2;if (nums[mid] < target)left = left + 1;else if (nums[mid] > target)right = right - 1;elsereturn mid;}return -1;
}int search(int* nums, int numsSize, int target)
{return find(nums, numsSize, target);
}