34. 在排序数组中查找元素的第一个和最后一个位置

给定一个按照升序排列的整数数组 nums，和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。

你的算法时间复杂度必须是 O(log n) 级别。

如果数组中不存在目标值，返回 [-1, -1]。

示例 1:

输入: nums = [5,7,7,8,8,10], target = 8
输出: [3,4]
示例 2:

输入: nums = [5,7,7,8,8,10], target = 6
输出: [-1,-1]

1.暴力破解法

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> res;
        bool flag = true;
        for(int i = 0;i < nums.size();++i){
            if(nums[i] == target && flag){
                res.push_back(i);
                flag = false;
            }
            if(nums[i] > target && !flag){
                res.push_back(i-1);
                break;
            }
        }
        
        if(res.size() == 1)
            res.push_back(nums.size()-1);
        if(res.empty())
            return {-1,-1};
        return res;
    }
};

 2.二分查找法

class Solution {
private:
	int findLowerBound(vector<int> &nums, int target) {
		int size = nums.size();
		int left = 0;
		int right = size - 1;
		while (left < right) {
			int mid = (left + right) >> 1;
			if (nums[mid] < target) {
				left = mid + 1;
			}
			else {
				right = mid;
			}
		}
		if (nums[left] != target) {
			return -1;
		}
		return left;
	}

	int findUpBound(vector<int> &nums, int target) {
		int size = nums.size();
		int left = 0;
		int right = size - 1;
		while (left < right) {
			int mid = (left + right + 1) >> 1;
			if (nums[mid] > target) {
				right = mid - 1;
			}
			else {
				left = mid;

			}
		}
		if (nums[left] != target) {
			return -1;
		}
		return left;
	}


public:
	vector<int> searchRange(vector<int> &nums, int target) {
		int size = nums.size();
		if (size == 0) {
			return{ -1, -1 };
		}
		int num1 = findLowerBound(nums, target);

		if (num1 == -1) {
			return{ -1, -1 };
		}
		int num2 = findUpBound(nums, target);
		return{ num1, num2 };
	}
};