小黑准备和老黑们“歌“以咏志了，心里十分紧张，昨晚一宿心跳一直加速的leetcode之旅:1457. 二叉树中的伪回文路径

小黑代码

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def pseudoPalindromicPaths (self, root: Optional[TreeNode]) -> int:
        self.count = 0
        # 判断其排列是否是回文
        def is_reverse_path(map_):
            count = 0
            # 字典每个字符出现的次数为基数的字符最多一个
            for (k, v) in map_.items():
                if v%2 != 0:
                    count += 1
                if count > 1:
                    return False
            return True
        # 递归函数
        def dfs(node, map_):
            if not node:
                return
            map_[node.val] += 1
            if not (node.left or node.right):
                if is_reverse_path(map_):
                    self.count += 1
                return
            dfs(node.left,copy.deepcopy(map_))
            dfs(node.right,deepcopy(map_))
        
        dfs(root,collections.defaultdict(int))
        return self.count

dfs+二进制编码(python)

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def pseudoPalindromicPaths (self, root: Optional[TreeNode]) -> int:
        self.count = 0
        # 根节点不存在
        if not root:
            return 0
        # 递归函数
        def dfs(node,temp):
            if not node:
                return 
            # 异或操作
            temp = temp ^ (1<<node.val)
            if not (node.left or node.right):
                if temp==0 or (temp&(temp-1) == 0):
                    self.count += 1
                return
            dfs(node.left,temp)
            dfs(node.right,temp)
        
        dfs(root,0)

        return self.count

dfs+二进制编码(java)

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    int count = 0;
    public int pseudoPalindromicPaths (TreeNode root) {
        dfs(root,0);
        return this.count;
    }
    public void dfs(TreeNode node, int temp){
        if(node == null){
            return;
        }
        temp = temp ^ (1<<node.val);
        if(node.left==null && node.right==null){
            if(temp==0 || (temp&(temp-1))==0){
                this.count += 1;
            }
            return;
        }
        dfs(node.left,temp);
        dfs(node.right,temp);
    }
}

小黑生活

这段时间最后的跑步

昨天早上和室友们去挂号啦，准备歌以咏志

中午吃个炸鸡

跟辅导员报备一下~

一会儿就要出发了，内心十分紧张，毕竟从小没怎么做过手术，怕疼！！但这也是一个让我成长的机会！！另外，也就是阶段还能出现宿舍能抱团一起去，真的是一件多年后值得回味的一件事！