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 abf4820 commit 2bd54e9Copy full SHA for 2bd54e9
find-minimum-in-rotated-sorted-array/gwbaik9717.js
@@ -0,0 +1,32 @@
1
+// Time complexity: O(logn)
2
+// Space complexity: O(1)
3
+
4
+/**
5
+ * @param {number[]} nums
6
+ * @return {number}
7
+ */
8
+var findMin = function (nums) {
9
+ let left = 0;
10
+ let right = nums.length - 1;
11
12
+ while (left < right) {
13
+ const mid = Math.floor((left + right) / 2);
14
15
+ if (nums.at(mid - 1) > nums.at(mid)) {
16
+ return nums[mid];
17
+ }
18
19
+ if (nums.at(mid + 1) < nums.at(mid)) {
20
+ return nums[mid + 1];
21
22
23
+ if (nums.at(mid + 1) > nums.at(right)) {
24
+ left = mid + 1;
25
+ continue;
26
27
28
+ right = mid - 1;
29
30
31
+ return nums[left];
32
+};
0 commit comments