[LeetCode]33 Search in Rotated Sorted Array

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

private int find(int[] A, int low, int high, int t)
{
if (low > high)
return -1;

if (low == high)
{
if (A[low] == t) return low;
return -1;
}

int mid = (low + high) / 2;

if (A[mid] == t)
{
return mid;
}

if (A[low] < A[mid]) // Since all numbers are unique, A[low] != A[mid]
{
if (A[low] <= t && t < A[mid])
return find(A, low, mid - 1, t);
else
return find(A, mid + 1, high, t);
}
else // A[low] > A[mid]
{
if (A[mid] < t && t <= A[high])
return find(A, mid + 1, high, t);
else
return find(A, low, mid - 1, t);
}
}
}