Skip to content

Commit 9a46c55

Browse files
committed
Feat: 153. Find Minimum in Rotated Sorted Array
1 parent 33bca46 commit 9a46c55

File tree

1 file changed

+20
-0
lines changed

1 file changed

+20
-0
lines changed
Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
/**
2+
* https://leetcode.com/problems/find-minimum-in-rotated-sorted-array
3+
* T.C. O(log n)
4+
* S.C. O(1)
5+
*/
6+
function findMin(nums: number[]): number {
7+
let left = 0;
8+
let right = nums.length - 1;
9+
let mid = (left + right) >> 1;
10+
11+
while (left < right) {
12+
if (nums[mid] > nums[right]) {
13+
left = mid + 1;
14+
} else {
15+
right = mid;
16+
}
17+
mid = (left + right) >> 1;
18+
}
19+
return nums[left];
20+
}

0 commit comments

Comments
 (0)