Skip to content

Commit d57a0b1

Browse files
committed
Find Minimum in Rotated Sorted Array
1 parent 1878e19 commit d57a0b1

File tree

1 file changed

+15
-0
lines changed

1 file changed

+15
-0
lines changed
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
function findMin(nums: number[]): number {
2+
let left = 0;
3+
let right = nums.length - 1;
4+
5+
while (left < right) {
6+
const middle = Math.floor((left + right) / 2);
7+
8+
if (nums[middle] < nums[right]) {
9+
right = middle;
10+
} else {
11+
left = middle + 1;
12+
}
13+
}
14+
return nums[left];
15+
}

0 commit comments

Comments
 (0)