> For the complete documentation index, see [llms.txt](https://r24zeng.gitbook.io/leetcode-notebook/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://r24zeng.gitbook.io/leetcode-notebook/wan-quan-an-zhao-jiu-zhang-suan-fa-shua-de-60-dao-zuo-you/binary-search/153.-find-minimum-in-rotated-sorted-array.md).

# 153. Find Minimum in Rotated Sorted Array

\# Medium

{% hint style="success" %}
Same as #33.
{% endhint %}

### Solution 1:

1. find the pivot as #33
2. consider 2 situations: this is an ascending list or rotated list
3. consider edge case: 1 element

### Solution 2:

find the pivot as #33.

```java
// java efficient
class Solution {
    public int findMin(int[] nums) {
        int left = 0, right = nums.length - 1;
        while(left < right) {
            int mid = left + (right - left)/2;
            if(nums[mid] > nums[right])
                left = mid + 1;
            else
                right = mid;
        }
        
        return nums[left];
    }
}
```