---
# System prepended metadata

title: Week11 (May 27)

---

# Week11 (May 27)

## 154. Find Minimum in Rotated Sorted Array II

### Question
Suppose an array of length <mark>$n$</mark> sorted in ascending order is rotated between <mark>$1$</mark> and <mark>$n$</mark> times. For example, the array <mark>nums = $[0,1,4,4,5,6,7]$</mark> might become:

* <mark>$[4,5,6,7,0,1,4]$</mark> if it was rotated <mark>$4$</mark> times.
* <mark>$[0,1,4,4,5,6,7]$</mark> if it was rotated <mark>$7$</mark> times.

Notice that **rotating** an array <mark>$[a[0], a[1], a[2], ..., a[n-1]]$</mark> **1** time results in the array <mark>$[a[n-1], a[0], a[1], a[2], ..., a[n-2]]$</mark>.

Given the sorted rotated array <mark>nums</mark> that may contain **duplicates**, return the minimum element of this array.

You must decrease the overall operation steps as much as possible.

### Hand in homework before Saturday.

:::success
[Roger的作業](https://github.com/GametreeRoger/LeetCode/blob/main/LeetCode154.playground/Contents.swift)
[xander的作業](https://github.com/Takumi47/30Plus/blob/main/30Plus/Problems/154_FindMinimumInRotatedSortedArrayII.swift)
...`Continue filling by yourself`
:::
