LeetCode 1457. 二叉树中的伪回文路径

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int ans =0;


    void pseudoPalindromicPathsInner(TreeNode* root,int T[10],int isSingle){
        if(root==NULL){
            return;
        }

        if(T[root->val]%2 != 0){
            isSingle--;
        }else{
            isSingle++;
        }
        T[root->val]++;


        if(root->left == NULL && root->right == NULL){
            for(int i =0; i < 10;i++){
                cout<< T[i] << " ";
            }
            if(isSingle<=1) ans++; return;
        }
        int TT[10];
        memcpy(TT,T,sizeof(int)*10);
        if(root->left != NULL){
            pseudoPalindromicPathsInner(root->left,TT,isSingle);
        }

        if(root->right != NULL){
            pseudoPalindromicPathsInner(root->right,T,isSingle); 
        }

        return;
    }

    int pseudoPalindromicPaths (TreeNode* root) {
        if(root == NULL){
            return 0;
        }
        int T[10]={0};
        T[root->val]++;
        int isSingle =1;

        if(root->left == NULL && root->right == NULL){
            if(isSingle<=1) ans++; return ans;
        }
        int TT[10];
        memcpy(TT,T,sizeof(int)*10);
        pseudoPalindromicPathsInner(root->left,TT,isSingle);
        pseudoPalindromicPathsInner(root->right,T,isSingle);

        return ans;
    }
};