Skip to content

Latest commit

 

History

History
42 lines (20 loc) · 597 Bytes

154-Find-Minimum-in-Rotated-Sorted-Array-II.md

File metadata and controls

42 lines (20 loc) · 597 Bytes

##Find Minimum in Rotated Sorted Array II Source: https://oj.leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii
###Description

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.
###Tags Array, Binary Search
###Solutions