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 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].

Have you been asked this question in an interview? 

 Key to solve: Binary Search => Time:O(logN)
    Same idea of Search Insert Position,
    but Run Binary Search 2 times,
    1. Scan from left -> right to locate 1st index of 1st number that match with target
    2. if not target is found, return [-1,-1]
    3. else scan from position of 1st index -> end

public class Solution {
    public int[] searchRange(int[] A, int target) {
        int[] out={-1,-1};
        if(A.length==0 || A==null)   return out;
        int len=A.length;

        int begin=0;
        int end=len-1;
        int mid=0;
        //To locate index of 1st number that match with target
        while(begin<=end){
             mid=(begin+end)/2;
            if(A[mid]<target){
                begin=mid+1;
            }else{
               end=mid-1;
            }
        }
        //detect whether the 1st target was found or not
        int left=(begin<len && A[begin]==target)?begin:-1;
        if(left==-1) return out;
        //To locate range of target
        int low=left;
        int right=len-1;
        while(low<=right){
            mid=(low+right)/2;
            if(A[mid]<=target){
                low=mid+1;
            }else{
                right=mid-1;
            }
        }
        out[0]=left;
        out[1]=right;
        return out;
    }
}