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

最直观的想法就是先二分查找目标值，接着向左右两边查找相等边界

具体实现如下：

#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;

/*
* 思路：在排序数组中查找元素的第一个和最后一个位置
* 二分查找找一个符合要求的数字，再分别向左右寻找
*/

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        int n = nums.size();
        int left = 0, right = n - 1, pos = -1;
        vector<int>res;
        while (left <= right)
        {
            int mid = (left + right) / 2;
            if (nums[mid] == target)
            {
                pos = mid;
                break;
            }
            else if (nums[mid] < target)
            {
                left = mid + 1;
            }
            else right = mid - 1;
        }
        if (pos == -1)
        {
            res.push_back(-1);
            res.push_back(-1);
            return res;
        }
        int i, j;
        for (i = pos - 1; i >= 0; i--)
        {
            if (nums[i] != target)
                break;
        }
        res.push_back(i + 1);
        for (j = pos + 1; j < n; j++)
        {
            if (nums[j] != target)
                break;
        }
        res.push_back(j - 1);
        return res;
    }
};


int main()
{
    int n, a, target;
    cin >> n;
    vector<int>nums;
    for (int i = 0; i < n; i++)
    {
        cin >> a;
        nums.push_back(a);
    }
    cin >> target;
    Solution A;
    vector<int> res = A.searchRange(nums, target);
    cout << res[0] << " " << res[1] << endl;
}