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]

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

class Solution {
    public int[] searchRange(int[] nums, int target) {
        int left = searchLeft(nums, target);
        int right = searchRight(nums, target);
        return new int[]{left, right};
    }
    private int searchLeft(int[] nums, int target){
        int left = 0;
        int right = nums.length-1;
        int mid = (left+right)>>>1;
        while(left <= right){
            if(nums[mid]==target && (mid==0 || nums[mid-1]!=target)){
                return mid;
            }else if(nums[mid] < target){
                left = mid+1;
            }else{
                right = mid-1;
            }
            mid = (left+right)>>>1;
        }
        return -1;
    }

    private int searchRight(int[] nums, int target){
        int left = 0;
        int right = nums.length-1;
        int mid = left + ((right-left)>>1);
        int ans = -1;
        while(left <= right){
            if(nums[mid]==target){
                if(mid==(nums.length-1) || nums[mid+1]!=target){
                    return mid;
                }
                ans = mid;
                left = mid+1;
            }else if(nums[mid] < target){
                left = mid+1;
            }else{
                right = mid-1;
            }
            mid = (left+right)>>>1;
        }
        return ans;
    }
}