Search in Rotated Sorted Array

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.

思路： Using binary search to find the element, but there are 2 situations. 这题有点特殊， 要 先判断 这个数组排列是哪种情况， mid 在偏左还是偏右。
易错点 ： 记住 target  <= A[low] 或者 A[high], 他们是有可能相等的。

public class Solution {
    public int search(int[] A, int target) {
        if(A.length < 1)
            return -1;
        int low = 0;
        int high = A.length - 1;
        while(low <= high){
            int mid = (low + high) / 2;
            if(A[mid] == target){
                return mid;
            }else {
                if(A[mid] >= A[low]){
                    if(target >= A[low] && target < A[mid]){
                        high = mid - 1;
                    }else{
                        low = mid + 1;
                    }
                }else {
                    if(target > A[mid] && target <= A[high]){
                        low = mid + 1;
                    }else{
                        high = mid - 1;
                    }
                }
            }
        }
        return -1;
    }
}