roma-dxunvrs
20 lines
510 B
Markdown
20 lines
510 B
Markdown
Leetcode #153 | #Medium | [[Бинарный поиск]]
|
|
## Идея
|
|
Это первый этап задачи [[Search in Rotated Sorted Array]].
|
|
## 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];
|
|
}
|
|
}
|
|
``` |