1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
| import Foundation
class For08Solution {
func findMin(_ n: [Int]) -> Int {
var s = n
return find(&s, 0, (n.count-1)/2, n.count-1)
}
func find(_ n: inout [Int],_ left: Int,_ mid: Int,_ right: Int) -> Int {
if left == mid {
return n[right]
}
if n[left] == n[right] && n[left] == n[mid] {
return min(n, left, right)
}
if n[left] > n[mid] {
return find(&n,left,(left+mid)/2,mid)
}
if n[mid+1] > n[right] {
return find(&n,mid+1,(mid+right/2),right)
}
return n[left] > n[mid+1] ? n[mid+1] : n[left]
}
func min(_ n: [Int],_ left: Int,_ right: Int) -> Int {
var res = n[left]
var r = left + 1
while r <= right {
if res > n[r] {
res = n[r]
}
r += 1
}
return res
}
}
|
