# 题目

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:

Example 2:

Note:

• This is a follow up problem to .
• Would allow duplicates affect the run-time complexity? How and why?

# 代码

------ 本文结束，感谢您的阅读 ------