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

问题：

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]

来自 https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/

分析：

数组有序，找出目标值的区间范围，和33. Search in Rotated Sorted Array类似

方法1：
直接暴力搜索，从左边开始比较，找出左区间，然后从右边找，找出右区间

//beats 100%
vector<int> searchRange(vector<int>& nums, int target) 
{
	vector<int>res;
	if (nums.empty()) { res.push_back(-1); res.push_back(-1); return res; }
	int L = nums.size();
	int left = 0;
	int right = L - 1;
	while (left < L)
	{
		if (nums[left] == target)
		{
			res.push_back(left); break;
		}
		left++;
	}
	while (right >=0)
	{
		if (nums[right] == target)
		{
			res.push_back(right); break;
		}
		right--;
	}
	if (left > right)
	{
		res.push_back(-1);
		res.push_back(-1);
	}
	return res;
}

时间复杂度：O(N)
空间复杂度：O(1)

方法2：
基于二分查找，不断压缩查找范围，当找到目标值时，左右扩展，找到最边界坐标

//beats 66%
vector<int> searchRange2(vector<int>& nums, int target)
{
	if (nums.empty()) 
		return{ -1,-1 };
	int left = 0;
	int right = nums.size() - 1;
	if ((target < nums[left])||(target>nums[right]))
		return{ -1,-1 };
	vector<int>res;
	while (left <= right)
	{	//中心扩展
		int mid = (left + right) / 2;
		if (nums[mid] == target)
		{
			int i = mid; int j = mid;
			while (i >= 0&& (nums[i] == target)) i--;
			res.push_back(i + 1); 
			while (j <= nums.size()-1&& (nums[j] == target))j++;
			res.push_back(j -1); 
			return res;
		}
		else if (target > nums[mid])
			left = mid + 1;
		else
			right = mid - 1;
	}
	return{-1,-1};
}

时间复杂度：O(logN)
空间复杂度：O(1)