Skip to content

Commit 64e4ddc

Browse files
committed
find minimum in rotated sorted array solution
1 parent e938765 commit 64e4ddc

1 file changed

Lines changed: 26 additions & 0 deletions

File tree

Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
/**
2+
์ด์ง„ํƒ์ƒ‰์„ ์ด์šฉํ•œ ํ’€์ด
3+
4+
TC: O(log n)
5+
SC: O(1)
6+
*/
7+
/**
8+
* @param {number[]} nums
9+
* @return {number}
10+
*/
11+
function findMin(nums) {
12+
let left = 0;
13+
let right = nums.length - 1;
14+
15+
while (left < right) {
16+
let mid = Math.floor((left + right) / 2);
17+
18+
if (nums[mid] > nums[right]) {
19+
left = mid + 1;
20+
} else {
21+
right = mid;
22+
}
23+
}
24+
25+
return nums[left];
26+
}

0 commit comments

Comments
ย (0)