-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdistribute-money-to-maximum-children.go
68 lines (62 loc) · 1.11 KB
/
distribute-money-to-maximum-children.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
package main
import (
"fmt"
)
// source: https://leetcode.com/problems/distribute-money-to-maximum-children/
func distMoney(money int, children int) int {
if money < children {
return -1
}
if money < 8 {
return 0
}
d, m, l := money/8, money%8, children-money/8
if d == children && m == 0 {
return children
}
if d >= children {
return children - 1
}
if m == 4 && l == 1 {
return children - 2
}
for m < l {
l++
m += 8
d--
}
return d
}
func main() {
testCases := []struct {
money int
children int
want int
}{
{
money: 20,
children: 3,
want: 1,
},
{
money: 16,
children: 2,
want: 2,
},
}
successes := 0
for _, tc := range testCases {
x := distMoney(tc.money, tc.children)
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)
}
}