Search in Rotated Sorted Array Java

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

Have you been asked this question in an interview?

Key to solve:
    This is a variant of BinarySearch, need to check more condition be-careful with rotated order
    set up "left" as LeftMost border pointer, "right" as RightMost Border pointer
    There are 3 cases:
    1. if A[mid]==target, then return mid;
    2. if A[mid]<A[right]=> elements between [mid, right] are sorted,
            => if target number belong to [mid, right] => left=m+1;
               else right=m-1
    3. if A[mid]>=A[left] => elements between [left,mid] are sorted
            => if target number belong to [left,mid] => right=m-1
                else left=m+1;

Check the coding below

public class Solution {
    public int search(int[] A, int target) {
       if(A.length==0 || A==null) return -1;
        int left=0;
        int right=A.length-1;
        while(left<=right){
            int mid=(left+right)/2;
            if(A[mid]==target){
                return mid;
            }else if(A[mid]<A[right]){
                //check weather target belong to the sorted range
                if(target>A[mid] && target<=A[right]){
                        left=mid+1;
                }else{
                    right=mid-1;
                }
            }else{
                //the case of A[mid]>=A[left]
                //check weather target belong to the sorted range
                if(target>=A[left] && target<A[mid]){
                    right=mid-1;
                }else{
                    left=mid+1;
                }
            }
        }
        return -1;
    }
}