LeetCode | 34. Find First and Last Position of Element in Sorted Array

最新推荐文章于 2022-05-24 15:41:14 发布

1LOVESJohnny

最新推荐文章于 2022-05-24 15:41:14 发布

阅读量148

点赞数

分类专栏： LeetCode 文章标签： LeetCode 二分查找 binary search

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/88935509

版权

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

题目：

Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

Example 1:

Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4]

Example 2:

Input: nums = [5,7,7,8,8,10], target = 6
Output: [-1,-1]

代码：

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
		vector<int> res{ -1, -1 };
		int low = 0, high = nums.size() - 1;
		while (low <= high)
		{
			int mid = (low + high) / 2;
			if (nums[mid] < target)
			{
				low = mid + 1;
			}
			else if (nums[mid] > target)
			{
				high = mid - 1;
			}
			else // nums[mid] == target
			{
				int i;
				for (i = mid; i >= 0 && nums[i] == target; i--);
				res[0] = i+1;
				for (i = mid; i < nums.size() && nums[i] == target; i++);
				res[1] = i-1;
				break;
			}
		}
		return res;
	}
};

题外话：

春天已经来啦，一切都又站在起点，有些微微地紧张，期待和害怕，加油~

迎来了新的挑战，相信自己。可以的~