LeetCode Top 100 Liked Questions 34. Find First and Last Position of Element in Sorted Array(Medium)

welcome to my blog

LeetCode Top 100 Liked Questions 34. Find First and Last Position of Element in Sorted Array(Java版; Medium)

题目描述

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]

第一次做, 两次二分法, 一次找左边界, 找到左边界的话, 继续找右边界, 找不到左边界的话就不用找右边界了

• 时间复杂度O(logN)

/*
分解问题:
两次二分, 一次找左边界, 一次找右边界
*/
class Solution {
    public int[] searchRange(int[] nums, int target) {
        if(nums==null || nums.length==0)
            return new int[]{-1, -1};
        int left=0, right=nums.length-1, mid;
        int leftBorder = -1, rightBorder = -1;
        //先找左边界
        while(left<=right){
            mid = left + ((right - left)>>1);
            if(nums[mid] < target)
                left = mid + 1;
            else if(nums[mid] > target)
                right = mid - 1;
            else{
                if(mid-1>=0 && nums[mid-1]==nums[mid]){
                    right = mid - 1;
                }
                else{
                    leftBorder = mid;
                    break;
                }
            }
        }
        //左边界为-1, 说明数组中没有target, 直接返回-1即可, 不用再找右边界了
        if(leftBorder == -1)
            return new int[]{-1, -1};
        //接下来找右边界
        left = leftBorder;//将left初始化为leftBorder, 算是一个小小小小小的优化
        right = nums.length-1;
        while(left<=right){
            mid = left + ((right - left)>>1);
            if(nums[mid] < target)
                left = mid + 1;
            else if(nums[mid] > target)
                right = mid - 1;
            else{
                //mid不是右边界
                if(mid+1<=nums.length-1 && nums[mid+1]==nums[mid])
                    left = mid + 1;
                //mid是右边界
                else{
                    rightBorder = mid;
                    break;
                }
            }
        }
        return new int[]{leftBorder, rightBorder};
    }
}