Files
obsidian/АиСД/Задачи/LeetCode/Find Minimum in Rotated Sorted Array.md
T
roma-dxunvrs 0e6e583e6d
deploy / Pull and Restart (push) Successful in 17s
refactor: wiki links -> md links
2026-09-22 08:52:23 +03:00

20 lines
602 B
Markdown

Leetcode #153 | #Medium | [Бинарный поиск](../../Методы/Бинарный%20поиск.md)
## Идея
Это первый этап задачи [Search in Rotated Sorted Array](Search%20in%20Rotated%20Sorted%20Array.md).
## Big-O
- Время ```O(log(N))```
- Память ```O(1)```
## Код
```Java
class Solution {
public int findMin(int[] nums) {
int l = -1, r = nums.length;
while (r - l > 1) {
int m = (l + r) / 2;
if (nums[m] <= nums[nums.length - 1]) r = m;
else l = m;
}
return nums[r];
}
}
```