给定一个 n 个元素有序的(升序)整型数组 nums 和一个目标值 target ,写一个函数搜索 nums 中的 target,如果目标值存在返回下标,否则返回 -1。
示例 1:
输入: nums = [-1,0,3,5,9,12], target = 9
输出: 4
解释: 9 出现在 nums 中并且下标为 4
示例 2:
输入: nums = [-1,0,3,5,9,12], target = 2
输出: -1
解释: 2 不存在 nums 中因此返回 -1
C++:
二分法:实际使用求中间mid索引建议用这种方法:int mid = left + (right-left)/2; 可以防止left+right溢出(超出整数范围)。
class Solution
{
public int search(int[] nums, int target)
{
int left = 0;
int right = nums.length - 1;
while(left <= right)
{
int mid = left + (right-left)/2;
// int mid = (left + right)/2;
if(nums[mid] > target)
{ right = mid - 1;}
else if(nums[mid] < target)
{ left = mid + 1;}
else
{ return mid; }
}
return -1;
}
}
递归:
class Solution
{
public:
int search(vector<int>& nums, int target)
{
return dfs(nums, target, 0, nums.size() - 1);
}
int dfs(vector<int>& nums, int& target, int l, int r)
{
if (l > r) return -1;
int mid = l + r >> 1;
if (nums[mid] < target)
return dfs(nums, target, mid + 1, r);
if (nums[mid] > target)
return dfs(nums, target, l, mid - 1);
return mid;
}
};
迭代:
class Solution {
public:
int search(vector<int>& nums, int target)
{
int l = 0, r = nums.size() - 1, mid;
while (l <= r)
{
mid = l + r >> 1;
if (nums[mid] == target) return mid;
if (nums[mid] < target) l = mid + 1;
if (nums[mid] > target) r = mid - 1;
}
return -1;
}
};
STL:lower_bound 二分查找,返回第一个大于等于 target 位置,关于lower_bound( )和upper_bound( )的常见用法
class Solution {
public:
int search(vector<int>& nums, int target) {
auto it = lower_bound(nums.begin(), nums.end(), target);
return it != nums.end() && *it == target ? it - nums.begin() : -1;
}
};
python:
class Solution:
def search(self, nums: List[int], target: int) -> int:
left,right=0,len(nums)-1
while(left<=right):
mid=(left+right)//2
if nums[mid]==target:
return mid
elif nums[mid]<target:
left=mid+1
else:
right=mid-1
return -1