[LeetCode 解题报告]034. 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]

考察：二分查找，返回待查值第一次和最后一次出现的index。

头文件<algorithm>中提供二分查找的函数有 3 个： 参考：https://www.cnblogs.com/Tang-tangt/p/9291018.html

•         lower_bound(val):返回容器中第一个值【大于或等于】val的元素的iterator位置。
•         upper_bound(val): 返回容器中第一个值【大于】

Method 1. 

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        if (nums.empty()) 
            return {-1, -1};
        
        if (target < nums.front() || target > nums.back()) 
            return {-1, -1};
        
        int left = distance(nums.begin(), lower_bound(nums.begin(), nums.end(), target)); // distance 计算二者距离，相对位置
        int right = distance(nums.begin(), prev(upper_bound(nums.begin(), nums.end(), target))); //prev()返回前一个位置
        if (nums[left] != target) // 没有找到target
            return {-1, -1};
        else 
            return {left, right};
    }
};

Method 2. 二分查找

class Solution {
public: 
    void binarySearch(vector<int>& nums, int left, int right, int target) {
        while (left <= right) {
            int mid = (left + right) / 2;
            if (nums[mid] > target)
                right = mid - 1;
            else if (nums[mid] < target)
                left = mid + 1;
            else {
                start = min(mid, start);
                end = max(mid, end);
                binarySearch(nums, left, mid-1, target);
                binarySearch(nums, mid+1, right, target);
                return ;
            }
        }
    }
    
    vector<int> searchRange(vector<int>& nums, int target) {
        if (nums.empty())
            return {-1, -1};
        if (target < nums.front() || target > nums.back())
            return {-1, -1};
        
        binarySearch(nums, 0, nums.size()-1, target);
        if (start == INT_MAX)
            return {-1, -1};
        else
            return {start, end};
    }
    
private:
    int start = INT_MAX;
    int end = INT_MIN;
};