We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 33bca46 commit 9a46c55Copy full SHA for 9a46c55
find-minimum-in-rotated-sorted-array/HC-kang.ts
@@ -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