leet_34_find_element_start_end（查找元素开始、结束位置）

• leet:地址
• 分类：二分查找
• 题目：
  • 给定一个int类型的升序数组，给定一个目标值target，查找该值在数组中出现的开始、结束位置。如果数组中没有该值，则返回[-1,-1]。
• 输入输出样例：
  • Input: nums = [5,7,7,8,8,10], target = 8
    Output: [3,4]
  • Input: nums = [5,7,7,8,8,10], target = 6
    Output: [-1,-1]
• c++ 实现

#include<iostream>
#include<vector>
using namespace std;

class Solution {
public:
	vector<int> arr;
	int target;
public:
	Solution(vector<int> a, int t) :arr(a), target(t) {};
	vector<int> findStartEnd() {
		vector<int> res = {-1, -1};
		int l = 0, h = arr.size();
		while (l < h)
		{
			int mid = (l + h) / 2;
			if (arr.at(mid) < target)
				l = mid + 1;
			else if (arr.at(mid) > target)
				h = mid - 1;
			else
				h = l = mid;
		}
		if (arr.at(h) != target)
			return res;
		while ((l - 1) >= 0  && arr.at(l - 1) == target)
			l -= 1;
		while ((h + 1) < arr.size() && arr.at(h + 1) == target)
			h += 1;
		res[0] = l;
		res[1] = h;
		return res;
	}

};

int main(int argc, char* argv[])
{
	vector<int> arr = { 3,3,7,7,10,11,11 };
	Solution *p = new Solution(arr, 11);
	vector<int> res = p->findStartEnd();
	cout << res.front() << ", "<< res.back() << endl;
	system("pause");
	return 0;
}