LeetCode T34 Find First and Last Position of Element in Sorted Array

题目地址

中文：https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/
英文：https://leetcode.com/problems/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].

Follow up: Could you write an algorithm with O(log n) runtime complexity?

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 <= 10^5
• -10^9 <= nums[i] <= 10^9
• nums is a non-decreasing array.
• -10^9 <= target <= 10^9

思路

O(logn)肯定不能顺序查了。
先二分，再以二分查找的坐标中心扩散。

题解

class Solution {
    public int[] searchRange(int[] nums, int target) {
        int left = 0;
        int right = nums.length-1;
        int mid = 0;
        int[] res = new int[]{-1,-1};
        if(nums.length==0) return res;
        boolean find = false;
        while(left<=right){
            mid = left + (right-left) / 2;
            if(nums[mid]==target) {
                find = true;
                break;
            }
            if(nums[mid] > target) right = mid-1;
            if(nums[mid] < target) left = mid+1;
        }
        int i = mid,j = mid;
        if(find){
            res[0] = mid;
            res[1] = mid;
            while(i-1>=0&&nums[i-1]==target) res[0] = --i;
            while(j+1<=nums.length-1&&nums[j+1]==target) res[1] = ++j;
        }
        return res;
    }
}