LeetCode 154. Find Minimum in Rotated Sorted Array II（旋转数组查找）

原题网址：https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/

Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

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).

Find the minimum element.

The array may contain duplicates.

方法：二分法。

public class Solution {
    /*
    最坏情况下，时间复杂度O(n)，对于头尾相等的每一段数组，都需要段内检查
    */
    private int find(int[] nums, int from, int to) {
        if (from == to) return nums[from];
        int m = (from+to)/2;
        if (nums[from] == nums[to]) {
            return Math.min(find(nums, from, m), find(nums, m+1, to));
        }
        if (nums[from] < nums[to]) {
            return nums[from];
        }
        // nums[from] > nums[to]
        if (nums[m] > nums[to]) {
            return find(nums, m+1, to);
        } else {
            return find(nums, from, m);
        }
    }
    public int findMin(int[] nums) {
        return find(nums, 0, nums.length-1);
    }
}

当在平移数组中应用二分法查找时，诀窍是要根据中点值与两端值先比较。