LeetCode 154. Find Minimum in Rotated Sorted Array II（二分）

题目来源：https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/

问题描述

154. Find Minimum in Rotated Sorted Array II

Hard

Suppose an array sorted in ascending order 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.

Example 1:

Input: [1,3,5]

Output: 1

Example 2:

Input: [2,2,2,0,1]

Output: 0

Note:

• This is a follow up problem to Find Minimum in Rotated Sorted Array.
• Would allow duplicates affect the run-time complexity? How and why?

------------------------------------------------------------

题意

LeetCode 153. Find Minimum in Rotated Sorted Array的姊妹题，求旋转升序数组的最小值，数组可能有重复

------------------------------------------------------------

思路

和LeetCode 153. Find Minimum in Rotated Sorted Array一样，需要用nums[0]作为基准判断，但是由于可能存在重复元素，需要过滤掉数组头和数组尾与nums[0]相同的元素，只留下一个数组头的nums[0]，否则会误导二分的过程。但是数组中间的重复元素没有影响。

------------------------------------------------------------

代码

class Solution {
    public int findMin(int[] nums) {
        int n = nums.length, l = -1, r = n, mid = 0;
        if (n == 0) {
            return 0;
        } else if (n == 1) {
            return nums[0];
        }
        while (r >= 1 && nums[--r] == nums[0]); // filter tails == nums[0]
        if (r == 0) {           // all numbers equal
            return nums[0];
        }
        while (l < n && nums[++l] == nums[0]);  // filter heads == nums[0]
        int ind = --l, pivot = nums[ind];
        if (pivot < nums[r]) {
            return pivot;
        }
        while (l < r) {
            mid = (l + r) / 2;
            if (mid == ind) {
                l = ind+1;
            } else if (nums[mid] > pivot) {
                l = mid + 1;
            } else {
                r = mid;
            }
        }
        return nums[r];
    }
}