原题链接:https://leetcode.cn/problems/count-paths-that-can-form-a-palindrome-in-a-tree/
func countPalindromePaths(parent []int, s string) int64 {
n := len(parent)
g := make([][]int, n)
for i := 1; i < n; i++ {
p := parent[i]
g[p] = append(g[p], i)
}
ans := 0
cnt := map[int]int{0: 1} // 一条「空路径」
var dfs func(int, int)
dfs = func(v, xor int) {
for _, w := range g[v] {
x := xor ^ (1 << (s[w] - 'a'))
ans += cnt[x] // x ^ x = 0
for i := 0; i < 26; i++ {
ans += cnt[x^(1<<i)] // x ^ (x^(1<<i)) = 1<<i
}
cnt[x]++
dfs(w, x)
}
}
dfs(0, 0)
return int64(ans)
}
参考链接:
https://www.bilibili.com/video/BV1n8411m7Fs?t=811.0
https://leetcode.cn/problems/count-paths-that-can-form-a-palindrome-in-a-tree/solution/yong-wei-yun-suan-chu-li-by-endlesscheng-n9ws/