34. 在排序数组中查找元素的第一个和最后一个位置

题目

给定一个按照升序排列的整数数组 nums，和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。如果数组中不存在目标值 target，返回 [-1, -1]。

代码

class Solution {
    public int[] searchRange(int[] nums, int target) {
        if (nums.length == 0 || nums[0] > target || nums[nums.length - 1] < target) {
            return new int[] {-1,-1};
        }
        int leftBorder = getLeftBorder(nums,target);
        int rightBorder = getRightBorder(nums,target);
        return new int[]{leftBorder,rightBorder};   
    }

    public int getLeftBorder(int[] nums, int target){
        int left = 0;
        int right = nums.length - 1;   
      
        while(left <= right){
            int mid = left + (right - left)/2;
            if(nums[mid] >= target){// nums[mid] == target，此时继续向左查找看nums数组中是否还有值与target相等
                right = mid - 1;  
            }else{
                left = mid + 1;
            }    
        }
        if(target == nums[left]){
            return left;
        }else{
            return -1;
        }
    }

    public int getRightBorder(int[] nums,int target){
        int left = 0;
        int right = nums.length - 1;
    
        while(left <= right){
            int mid = left + (right - left)/2;
            if(nums[mid] > target){
                right = mid - 1;        
            }else{ // nums[mid] == target，此时继续向右查找看nums数组中是否还有值与target相等
                left = mid + 1;
            }    
        }
        if(target == nums[right]){
            return right;
        }else{
            return -1;
        }
    }
}