Search for a Range

最新推荐文章于 2019-10-09 14:22:08 发布

我就是多啦a梦

最新推荐文章于 2019-10-09 14:22:08 发布

阅读量280

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/u014682691/article/details/52372437

版权

leetcode 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

class Solution {
public:
	vector<int> searchRange(vector<int>& nums, int target) {
		vector<int> result;
		int tmp = 0;
		int left = 0, right = nums.size(), mid = 0;
		//if (left == right) return nums[0] == target ? vector<int>{0, 0} : vector<int>{ -1, -1 };
		while (left<right){
			mid = (left + right) / 2;
			if (nums[mid] == target){
				tmp = mid;
				while (mid>0&&nums[mid - 1] == target) mid--;
				while (tmp<nums.size()-1&&nums[tmp + 1] == target) tmp++;
				return vector<int> {mid, tmp};
			}
			else if (nums[mid]<target){
				left = mid + 1;
			}
			else{
				right = mid;
			}

		}
		return vector<int> {-1, -1};
	}
};