Skip to content

Commit d33110d

Browse files
authored
find minimum in rotated sorted array solution
1 parent 8c9f7df commit d33110d

File tree

1 file changed

+16
-0
lines changed

1 file changed

+16
-0
lines changed
Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
object Solution {
2+
def findMin(nums: Array[Int]): Int = {
3+
var l = 0
4+
var r = nums.size
5+
while (l != r) {
6+
val m = l + ((r - l) >> 1)
7+
// T(n) = lg(n)
8+
if (nums(m) <= nums.last) {
9+
r = m
10+
} else {
11+
l = m + 1
12+
}
13+
}
14+
nums(l)
15+
}
16+
}

0 commit comments

Comments
 (0)