二分--查找数组中第一次出现的位置以及最后一次出现的位置

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]

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> Result(2,-1);
    if(nums.size() == 0){return Result;}
    int LeftIndex = 0;
    int RightIndex = nums.size() - 1;
    while(LeftIndex < RightIndex){
        int mid = (LeftIndex + RightIndex) / 2;
        if(nums[mid] < target){
            LeftIndex = mid + 1;
        }
        else{
            RightIndex = mid;
        }
    }
    if(nums[LeftIndex] != target){return Result;}
    else{
        Result[0] = LeftIndex;
    }
    RightIndex = nums.size() - 1;
    while(LeftIndex < RightIndex){
        int mid = (LeftIndex + RightIndex) / 2 + 1;
        if(nums[mid] > target){
            RightIndex = mid - 1;
        }
        else{
            LeftIndex = mid;
        }
    }
    Result[1] = RightIndex;
    return Result;
    }
};