题目描述
leetcode原题链接:在排序数组中查找元素的第一个和最后一个位置
给定一个按照升序排列的整数数组 nums
,和一个目标值 target
。找出给定目标值在数组中的开始位置和结束位置。如果数组中不存在目标值,返回 [-1, -1]
。
举例
示例1: 输入:nums = [5,7,7,8,8,10] target=8 输出:[3,4]
示例2: 输入: nums = [5,7,7,8,8,10] target=6 输出:[-1,-1]
示例3: 输入: [] 输出:[-1, -1]
解题方法: 二分查找。二分查找写的方法有很多,我比较喜欢用下面这种方式写,简单清晰。
代码
#include <iostream>
#include <vector>
int left_bound(const std::vector<int>& nums, int target) {
int n = nums.size();
if (n <= 0) {
return -1;
}
int low = 0;
int high = n - 1;
while (low <= high) { //注意搜索区间
int mid = (low + high) / 2;
if (target <= nums[mid]) { //目标值在左边
high = mid - 1;
} else {
low = mid + 1;
}
}
// 如果存在target,则low指向最左边那个,high指向最后一个小于target的位置
if (low >= 0 && nums[low] == target) {
return low;
} else { //如果不存在,则high指向小于target的最大值位置,low指向大于target的最小值位置
return -1;
}
}
int right_bound(const std::vector<int>& nums, int target) {
int n = nums.size();
if (n <= 0) {
return -1;
}
int low = 0;
int high = n - 1;
while (low <= high) { //注意搜索区间
int mid = (low + high) / 2;
if (target >= nums[mid]) { //目标在右边
low = mid + 1;
} else {
high = mid - 1;
}
}
// // 如果存在target,则low指向最右边那个
if (high < n && nums[high] == target) {
return high;
} else { // 如果不存在target,则low指向第一个大于target的值位置,high指向最后一个小于target的值位置
return -1;
}
}
void print_result(const std::vector<int>& nums, int target, int left, int right)
{
std::cout << "========" << std::endl;
std::cout << "input:" << std::endl;
std::cout << "nums:";
for (auto num : nums) {
std::cout << num << ",";
}
std::cout << " , target: " << target << std::endl;
std::cout << "output:" << std::endl;
std::cout << "left_bound: " << left << ", right_bound: " << right << std::endl;
}
int main()
{
// case1: nums=[5,7,7,8,8,10] target:8 ==> [3,4]
std::vector<int> nums = {5, 7, 7, 8, 8, 10};
int target = 8;
int left = left_bound(nums, target);
int right = right_bound(nums, target);
print_result(nums, target, left, right);
// case2: nums=[5,7,7,8,8,6] target:6 ==> [-1,-1]
nums = {5, 7, 7, 8, 8, 6};
target = 6;
left = left_bound(nums, target);
right = right_bound(nums, target);
print_result(nums, target, left, right);
// case3: nums=[], target:0 ==> [-1,-1]
nums = {};
target = 0;
left = left_bound(nums, target);
right = right_bound(nums, target);
print_result(nums, target, left, right);
return 0;
}
代码运行结果如下:
========
input:
nums:5,7,7,8,8,10, , target: 8
output:
left_bound: 3, right_bound: 4
========
input:
nums:5,7,7,8,8,6, , target: 6
output:
left_bound: -1, right_bound: -1
========
input:
nums: , target: 0
output:
left_bound: -1, right_bound: -1