-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
69 lines (58 loc) · 1.02 KB
/
main.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
package main
import (
"fmt"
)
func main() {
fmt.Println(generatePalindromes("aabbhijkkjih"))
}
func generatePalindromes(s string) []string {
result = nil
var tmp []byte
for i := 0; i < len(s); i++ {
tmp = append(tmp, '1')
}
runner(s, tmp, make([]bool, len(s)), 0, len(s)-1, true)
return result
}
var (
result []string
)
func runner(s string, tmp []byte, used []bool, k, last int, dir bool) {
if isPalindrome(string(tmp)) {
result = append(result, string(tmp))
}
check := make(map[byte]bool)
for i := 0; i < len(s); i++ {
if used[i] || check[s[i]] {
continue
}
check[s[i]] = true
used[i] = true
prev := tmp[k]
if dir {
tmp[k] = s[i]
runner(s, tmp, used, k+1, last, !dir)
} else {
if tmp[k-1] == s[i] {
tmp[last] = s[i]
runner(s, tmp, used, k, last-1, !dir)
}
}
tmp[k] = prev
used[i] = false
}
}
func isPalindrome(s string) bool {
l, r := 0, len(s)-1
for l <= r {
if s[l] == '1' {
return false
}
if s[l] != s[r] {
return false
}
l++
r--
}
return true
}