-
Notifications
You must be signed in to change notification settings - Fork 0
/
MinPerimeterRectangle.go
77 lines (66 loc) · 1.02 KB
/
MinPerimeterRectangle.go
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
package minperimeterrectangle
import (
"math"
)
// O(sqrt(N))
func Solution(N int) int {
if N <= 0 {
return 0
}
min := math.MaxInt32
for i := 1; i*i <= N; i++ {
if N%i == 0 {
perimeter := 2 * (i + N/i)
min = int(math.Min(float64(min), float64(perimeter)))
}
}
if min == math.MaxInt32 {
return 0
}
return min
}
/*
O(N)
Task Score 60%
Correctness 100%
Performance 20%
*/
func Solution1(N int) int {
if N <= 0 {
return 0
}
min := math.MaxInt32
for i := 1; i <= N; i++ {
if N%i == 0 && i*i <= N {
perimeter := 2 * (i + N/i)
min = int(math.Min(float64(min), float64(perimeter)))
}
}
if min == math.MaxInt32 {
return 0
}
return min
}
// O(sqrt(N))
func Solution2(N int) int {
if N <= 0 {
return 0
}
pairs := make(map[int]int)
i := 1
for i*i <= N {
if N%i == 0 {
pairs[i] = N / i
}
i++
}
min := math.MaxInt32
for i, v := range pairs {
perimeter := 2 * (i + v)
min = int(math.Min(float64(min), float64(perimeter)))
}
if min == math.MaxInt32 {
return 0
}
return min
}