[LeetCode] Find Minimumin Rotated Sorted Array II

    public int findMin(List<Integer> nums) {//solution1 O(log(N))
        int min = Integer.MAX_VALUE;
        int l = 0, r = nums.size()-1,mid;

        while (l < r){
            if(l + 1 == r){
                min = Math.min(min, Math.min(nums.get(l),nums.get(r)));
                return min;
            }
            mid = r + (l - r) / 2;
            if(nums.get(l) == nums.get(r)){//重复数据
                l ++;
                continue;
            }else if(nums.get(l) < nums.get(r)){
                min = nums.get(l);
                return min;
            }else {
                if(nums.get(mid) == nums.get(r)){//表明右边的数据都相等
                    r = mid;
                }else if(nums.get(mid) > nums.get(r)){
                    l = mid;
                }else if(nums.get(mid) < nums.get(r)){
                    r = mid;
                }
            }
        }
        min = Math.min(min, nums.get(l));
        return min;

    }

[LeetCode] Find Minimumin Rotated Sorted Array II

原文：http://blog.csdn.net/youmengjiuzhuiba/article/details/45110395