-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmain1.go
67 lines (53 loc) · 945 Bytes
/
main1.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
package main
import (
"bufio"
"fmt"
"os"
"strings"
)
func main() {
scanner := bufio.NewScanner(os.Stdin)
sum := 0
for scanner.Scan() {
fields := strings.Fields(scanner.Text())
sum += arrangements(fields[0], toList(fields[1]))
}
fmt.Println(sum)
}
func arrangements(s string, num []int) int {
s = strings.Trim(s, ".")
if s == "" {
if len(num) == 0 {
return 1
}
return 0
}
if len(num) == 0 {
if strings.Contains(s, "#") {
return 0
}
return 1
}
sum := 0
if s[0] == '?' {
// check recursively whether the first is '.'
sum += arrangements(s[1:], num)
// and now consider whether the first is '#'
s = "#" + s[1:]
}
if len(s) < num[0] {
return sum
}
if strings.ContainsRune(s[:num[0]], '.') {
return sum
}
if len(s) > num[0] {
switch s[num[0]] {
case '#':
return sum
case '?':
s = s[:num[0]] + "." + s[num[0]+1:]
}
}
return sum + arrangements(s[num[0]:], num[1:])
}