题目
解法1:
利用backtracking生成每条根节点到叶结点的路径,在利用字典注意判断。一条路径的permutaion要可以回文的条件是奇数个的数字个数只能是0或1
class Solution:
def pseudoPalindromicPaths (self, root: TreeNode) -> int:
def dfs(node,path):
if not node:
return
path.append(node.val)
if not node.left and not node.right:
paths.append(path[:])
dfs(node.left,path[:])
dfs(node.right,path[:])
path.pop()
paths = []
path = []
dfs(root,path)
ans = 0
for path in paths:
dic = collections.defaultdict(int)
for v in path:
dic[v]+=1
odd = 0
for v in dic.values():