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.
2 parents 3121d3d + 265a17f commit f6903ccCopy full SHA for f6903cc
153 Find Minimum in Rotated Sorted Array.js
@@ -10,19 +10,28 @@ var findMin = function(nums) {
10
var s = 0;
11
var e = nums.length - 1;
12
var min;
13
-
+
14
while(s<e-1){
15
var mid = s + parseInt((e-s)/2);
16
17
if(nums[mid] < nums[s]){
18
e = mid;
19
} else if(nums[mid] > nums[e]) {
20
s = mid;
21
} else {
22
return nums[s];
23
}
24
25
26
27
return Math.min(nums[e], nums[s]);
28
-};
+};
29
30
+// Another shorter solution;
31
+var findMin = function(nums) {
32
+ var i = 0;
33
+ while(i < nums.length - 1 && nums[i] < nums[i + 1]) {
34
+ i++;
35
+ }
36
+ return (i === nums.length - 1)? nums[0] : nums[i + 1]
37
0 commit comments