LintCode: Search in Rotated Sorted Array

public class Solution {
    /** 
     *@param A : an integer rotated sorted array
     *@param target :  an integer to be searched
     *return : an integer
     */
    public int search(int[] A, int target) {
        // write your code here
        // handle corner case
        if (A == null || A.length == 0) {
            return -1;
        }
        
        // find the break point
        int start = 0, end = A.length - 1;
        int element = A[end];
        int point = 0;
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            int current = A[mid];
            if (current < element) {
                end = mid;
            } else {
                start = mid;
            }
        }
        if (A[start] < element) {
            point = start;
        } else {
            point = end;
        }
        
        if (A[point] == target) {
            return point;
        }
        end = A.length - 1;
        // decide which part to search
        if (target <= A[end]) {
            start = point + 1;
        } else {
            start = 0;
            end = point - 1;
        }
        // begin binary search
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            int current = A[mid];
            if (target > current) {
                start = mid;
            } else if (target < current){
                end = mid;
            } else {
                return mid;
            }
        }
        if (A[start] == target) {
            return start;
        }
        if (A[end] == target) {
            return end;
        }
        return -1;
    }
}