20、在排序数组中查找元素的第一个和最后一个位置
题目
20.0、暴力解法
这道题真滴非常简单,遍历一遍数组,记录目标数的第一个和最后一个就OK了,不会一遍遍历,那就两遍遍历,一遍找开始,一遍找结束。
vector<int> searchRange0(vector<int>& nums, int target)
{
if (nums.empty())return { -1,-1 };
vector<int> result;
for (int i = 0; i < (int)nums.size(); i++)
{
if (result.empty() && nums[i] == target)
result = { i,i };
if (nums[i] == target)result[1] = i;
else if (!result.empty())break;
}
return result.empty() ? vector<int>{-1, -1} : result;
}
- 时间复杂度:O(n)
- 空间复杂度:O(1)
20.1、二分查找
既然题目给了升序这个条件,不用白不用,用二分查找分别找到两边即可(注意细节,能死人的)
vector<int> searchRange1(vector<int>& nums, int target)
{
if (nums.empty())return { -1,-1 };
int leftTarget = findIndex(nums, target, true);
if (nums[leftTarget] != target)return { -1,-1 };
int rightTarget = findIndex(nums, target, false);
return { leftTarget,nums[rightTarget] == target ? rightTarget : rightTarget - 1 };
}
int findIndex(vector<int>& nums, int target, bool flag)
{
int leftIndex = 0, rightIndex = nums.size() - 1;
while (leftIndex < rightIndex)
{
int midIndex = (leftIndex + rightIndex) / 2;
if (nums[midIndex] > target || (flag && nums[midIndex] == target))
rightIndex = midIndex;
else
leftIndex = midIndex + 1;
}
return leftIndex;
}
- 时间复杂度:O(log n)应该是两个log n
- 空间复杂度:O(1)