LeetCode—search-for-a-range（找一个值的范围）—java

题目描述：

Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order ofO(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].

思路解析：

• 第一次循环先找到指定的值
• 然后第二次循环找到范围的最大值
• 第三次循环找到范围的最小值

代码：

public class Solution {
    public int[] searchRange(int[] A, int target) {
        int[] res = {-1,-1};
        if(A==null||A.length==0){
            return res;
        }
        int low = 0;
        int high= A.length-1;
        int pos =0;
        while(low<=high){
            int mid = (low+high)/2;
            pos= mid;
            if(A[mid]>target){
                high = mid-1;
            }else if(A[mid]<target)
                low =  mid+1;
            else{
                res[0]=pos;
                res[1]=pos;
                break;
            }
        }
        if(A[pos]!=target)
            return res;
        int newlow = pos;
        int newhigh = A.length-1;
        while(newlow<=newhigh){
            int mid = (newlow+newhigh)/2;
            if(A[mid]==target){//注意这里是判断是否还等于目标值
                newlow = mid +1;//找到最右边的界限
            }else{
                newhigh = mid -1;
            }
        }
        res[1]=newhigh;//注意这里是右边的界限
        newlow = 0;
        newhigh = pos;
        while(newlow<=newhigh){
            int mid = (newlow+newhigh)/2;
            if(A[mid]==target){
                newhigh = mid -1;
            }else{
                newlow = mid +1;
            }
        }
        res[0]=newlow;//左边的界限，是左的
        return res;
    }
}