[leetcode] Search in Rotated Sorted Array II

/**
 * http://blog.csdn.net/linhuanmars/article/details/20525681
 * 
 * @author jd
 * 
 */

public class Solution {
    public boolean search(int[] A, int target) {
        if (A == null || A.length == 0)
            return false;
        int l = 0;
        int r = A.length - 1;
        while (l <= r) {
            int m = (l + r) / 2;
            if (A[m] == target)
                return true;
            if (A[m] > A[l]) {
                if (A[m] > target && A[l] <= target) {
                    r = m - 1;
                } else {
                    l = m + 1;
                }
            } else if (A[m] < A[l]) {
                if (A[m] < target && A[r] >= target) {
                    l = m + 1;
                } else {
                    r = m - 1;
                }
            } else {
                l++;
            }
        }
        return false;
    }

    public static void main(String[] args) {

        System.out.println(new Solution().search(new int[] { 3, 1, 1 }, 3));

        System.out.println(new Solution().search(new int[] { 2, 3, 3, 3, 3 }, 2));
        System.out.println(new Solution().search(new int[] { 3, 2, 3, 3, 3 }, 2));
        System.out.println(new Solution().search(new int[] { 3, 3, 3, 2, 3 }, 2));
        System.out.println(new Solution().search(new int[] { 3, 3, 3, 3, 2 }, 2));

    }

}