【leetcode】34. Find First and Last Position of Element in Sorted Array

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]

题目链接：https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/

不全的思路

原本的思路是：先用二分查找找到一个target，然后再根据上一轮的头尾指针，找边界。

缺点：如果头尾指针范围小于target范围，则找不全；如果要找全的话得从target向整个串的首尾再做两次二分查找，则不优雅。

正确打开方式的思路

先找左边界，然后找右边界。

网友整理的思路：https://leetcode.wang/leetCode-34-Find-First-and-Last-Position-of-Element-in-Sorted-Array.html

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        int l = 0, r = nums.size() - 1;
        vector<int> res = {-1, -1};
        while(l <= r){
            int m = (l + r) / 2;
            if (nums[m] > target) r = m - 1;
            else if(nums[m] < target) l = m + 1;
            else if(m>0 && nums[m - 1] == target) {
                res[0] = m; // 处理数组只有一个值的情况
                r = m-1;    // 不能是m，因为m可能陷入死循环
            }
            else{
                res[0] = m;
                l = m;
                break;
            }
        }
        if (res[0] == -1) return res;
        r = nums.size() - 1;
        while(l<=r){
            int m = (l + r) / 2;
            if (nums[m] > target) r = m - 1;
            else if(nums[m] < target) l = m + 1;
            else if(m<(nums.size()-1) && nums[m + 1] == target) {
                l = m+1;
                res[1] = m;
            }
            else{
                res[1] = m;
                break;
            }
        }
        return res;
    }
};