Search for a Range LeetCode

题目

Given an array of integers 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].

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].

思路

要求时间复杂度O(logn)，当然不能用暴力for循环去解决，想到用二分查找，找到第一次出现target值的位置pos，然后马上退出查找，再分别在pos的左边和右边寻找与target相等的最小和最大位置。

代码

public class Solution {
    public int[] searchRange(int[] nums, int target) {
        int arr[] = {-1,-1};
        int left = 0,right = nums.length-1;
        int pos = -1;
        while(left <= right){
            int mid = (left + right) / 2;
            if(nums[mid] < target){
                left = mid + 1;
            }
            if(nums[mid] > target){
                right = mid - 1;
            }
            if(nums[mid] == target){
                pos = mid;
                arr[0] = arr[1] = pos;
                break;
            }
        }
        int t = pos;
        while(t > 0){
            if(nums[t-1] != nums[t]){
                break;
            }else{
                t--;
                arr[0] = t;
            }
        }
        while(pos != -1 && pos < nums.length-1){
            if(nums[pos+1] != nums[pos]){
                break;
            }else{
                pos++;
                arr[1] = pos; 
            }
        }
        return arr;
    }
}