Skip to content

Commit d000117

Browse files
committed
Add scala solution for 153-Find-Minimum-in-Rotated-Sorted-Array
1 parent 4253d53 commit d000117

File tree

1 file changed

+24
-0
lines changed

1 file changed

+24
-0
lines changed

Diff for: scala/153-Find-Minimum-in-Rotated-Sorted-Array.scala

+24
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
object Solution {
2+
def findMin(nums: Array[Int]): Int = {
3+
var res = nums(0)
4+
var (left, right) = (0, nums.length - 1)
5+
6+
while (left <= right) {
7+
if (nums(left) < nums(right)) {
8+
res = res.min(nums(left))
9+
left = right + 1 // break condition
10+
} else {
11+
val mid = (left + right) / 2
12+
res = res.min(nums(mid))
13+
14+
if (nums(mid) >= nums(left)) {
15+
left = mid + 1
16+
} else {
17+
right = mid - 1
18+
}
19+
}
20+
}
21+
22+
return res
23+
}
24+
}

0 commit comments

Comments
 (0)