# Find Minimum in Rotated Sorted Array LeetCode Solution Share:

Find Minimum in Rotated Sorted Array Suppose an array of length `n` sorted in ascending order is rotated between `1` and `n` times. For example, the array `nums = [0,1,2,4,5,6,7]` might become:

• `[4,5,6,7,0,1,2]` if it was rotated `4` times.
• `[0,1,2,4,5,6,7]` if it was rotated `7` times.

Notice that rotating an array `[a, a, a, ..., a[n-1]]` 1 time results in the array `[a[n-1], a, a, a, ..., a[n-2]]`.

Given the sorted rotated array `nums` of unique elements, return the minimum element of this array.

You must write an algorithm that runs in `O(log n) time.`

Example 1:

```Input: nums = [3,4,5,1,2]
Output: 1
Explanation: The original array was [1,2,3,4,5] rotated 3 times.
```

Example 2:

```Input: nums = [4,5,6,7,0,1,2]
Output: 0
Explanation: The original array was [0,1,2,4,5,6,7] and it was rotated 4 times.
```

Example 3:

```Input: nums = [11,13,15,17]
Output: 11
Explanation: The original array was [11,13,15,17] and it was rotated 4 times.
```

Constraints:

• `n == nums.length`
• `1 <= n <= 5000`
• `-5000 <= nums[i] <= 5000`
• All the integers of `nums` are unique.
• `nums` is sorted and rotated between `1` and `n` times.

Time: O( log n)
Space: O(1)

### C++

``````class Solution {
public:
int findMin(vector<int>& nums) {
int l = 0;
int r = nums.size() - 1;

while (l < r) {
const int m = l + (r - l) / 2;
if (nums[m] < nums[r])
r = m;
else
l = m + 1;
}

return nums[l];
}
};
``````

### Java

`````` class Solution {
public int findMin(int[] nums) {
int l = 0;
int r = nums.length - 1;

while (l < r) {
final int m = l + (r - l) / 2;
if (nums[m] < nums[r])
r = m;
else
l = m + 1;
}

return nums[l];
}
}

``````

### Python

``````
class Solution:
def findMin(self, nums: List[int]) -> int:
l = 0
r = len(nums) - 1

while l < r:
m = (l + r) // 2
if nums[m] < nums[r]:
r = m
else:
l = m + 1

return nums[l]
``````

#### Watch Tutorial

Checkout more Solutions here