题目链接: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.
大神参考链接:http://blog.youkuaiyun.com/linhuanmars/article/details/40449299