题目
给定一个 n 个元素有序的(升序)整型数组 nums 和一个目标值 target ,写一个函数搜索 nums 中的 target,如果目标值存在返回下标,否则返回 -1。
示例
输入: nums = [-1,0,3,5,9,12], target = 9
输出: 4
解释: 9 出现在 nums 中并且下标为 4
C++暴力解法
class Solution {
public:
int search(vector<int>& nums, int target) {
for(int i = 0;i < nums.size();i++){ //遍历整个数组
if(nums[i] == target){
return i;
}
}
return -1;
}
};
C++二分查找,区间为[low, high]的情况
class Solution {
public:
int search(vector<int>& nums, int target) {
int low = 0, high = nums.size()-1, mid; //注意这里high
while (low <= high) { //注意这里的等号
mid = (low + high) / 2;
if (nums[mid] > target) {
high = mid - 1; //注意high = mid -1;
}
else if (nums[mid] < target) {
low = mid + 1;
}
else {
return mid;
}
}
return -1;
}
};
对于数组区间是[low, high]的情况:
因为数组的两端都是闭区间,能取到low==high的情况,故while(low<=high)需要取到等号。且当nums[mid] > target时,high = mid - 1;
C++二分查找,区间为[low, high)的情况
class Solution {
public:
int search(vector<int>& nums, int target) {
int low = 0, high = nums.size(), mid; //注意这里high
while (low < high) {
mid = (low + high) / 2;
if (nums[mid] > target) {
high = mid ; //注意high = mid;
}
else if (nums[mid] < target) {
low = mid + 1;
}
else {
return mid;
}
}
return -1;
}
};
对于数组区间是[low, high)的情况:
因为数组的两端都是闭区间,不能取到low==high的情况,故while(low< high)不需要取到等号。且当nums[mid] > target时,high = mid;
python代码二分法
class Solution:
def search(self, nums: List[int], target: int) -> int:
low, high = 0,len(nums)-1
while(low <= high):
mid = (low + high)//2
if nums[mid] > target:
high = mid - 1
elif nums[mid] < target:
low = mid + 1
else:
return mid
return -1