Leetcode34(c++).

leetcode34 (c++).

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.

If target is not found in the array, return [-1, -1].

You must write an algorithm with O(log n) runtime complexity.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

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]

Example 3:

Input: nums = [], target = 0
Output: [-1,-1]

Constraints:

0 <= nums.length <= 105
-109 <= nums[i] <= 109
nums is a non-decreasing array.
-109 <= target <= 109

code:

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        int left1 = 0;
        int right = nums.size();

        while(left1 < right){
            int mid = left1+(right - left1)/2;
            if(nums[mid] >= target)     right = mid;
            else                        left1 = mid+1;
        }
        if(left1 == nums.size() || nums[left1] != target)   {
            left1 = -1;
            return {-1,-1};
        }

        int left2 = 0;
        right = nums.size();

        while(left2 < right){
            int mid = left2+(right - left2)/2;
            if(nums[mid] > target)     right = mid;
            else                       left2 = mid+1;
        }
        
        return {left1,left2-1};
    }
};

Harvest:

1、Binary search involves many boundary problems For example, while
(left < right) or while (left < = right); Is it (right = = mid) or
(right = = mid-1);

2、Conclusion: Dichotomy interval is generally divided into two kinds
[left, right] or [left, right]; If it is the first one, then (right =
= mid-1); Conversely (right = = mid);

Records from a CET-4 student and C + + rookie