Search for a Range

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

public class Solution {
    public int[] searchRange(int[] A, int target) {
        int leftBound =-1;
        int rightBound =-1;
        int len = A.length;
        int start = 0;
        int end = len -1;
        while(start<=end){
            int mid = (start+end)/2;
            if(target == A[mid]){
                leftBound =mid;
            } 
            if(target<=A[mid]){
                end = mid-1;
            }
            else{
                start = mid+1;
            }
        }
        if(leftBound==-1) return new int[]{leftBound,rightBound};
        start = leftBound;end=len-1;
        while(start<=end){
            int mid = (start+end)/2;
            if(target == A[mid]){
                rightBound =mid;
            }
            if(target>=A[mid]){
                    start = mid+1;
            }
            else{
                end = mid-1;
            }
        }
        return new int[]{leftBound,rightBound};
    }
}