-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathkoko-eating-bananas.go
72 lines (65 loc) · 1.16 KB
/
koko-eating-bananas.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
package main
import (
"fmt"
)
// source: https://leetcode.com/problems/koko-eating-bananas/
func minEatingSpeed(piles []int, h int) int {
check := func(k int) bool {
hours := 0
for _, p := range piles {
hours += p / k
if p%k != 0 {
hours++
}
}
return hours > h
}
i, j := 1, 1<<31-1
for i < j {
m := int(uint(i+j) >> 1)
if check(m) { // if f(m) less
i = m + 1
} else {
j = m
}
}
return i
}
func main() {
testCases := []struct {
piles []int
h int
want int
}{
{
piles: []int{3, 6, 7, 11},
h: 8,
want: 4,
},
{
piles: []int{30, 11, 23, 4, 20},
h: 5,
want: 30,
},
{
piles: []int{30, 11, 23, 4, 20},
h: 6,
want: 23,
},
}
successes := 0
for _, tc := range testCases {
x := minEatingSpeed(tc.piles, tc.h)
status := "ERROR"
if fmt.Sprint(x) == fmt.Sprint(tc.want) {
status = "OK"
successes++
}
fmt.Println(status, " Expected: ", tc.want, " Actual: ", x)
}
if l := len(testCases); successes == len(testCases) {
fmt.Printf("===\nSUCCESS: %d of %d tests ended successfully\n", successes, l)
} else {
fmt.Printf("===\nFAIL: %d tests failed\n", l-successes)
}
}