IF语句陷阱

921. 统计唯一值子树个数

中文English

给定一棵二叉树，统计唯一值子树的数目.

唯一值子树意味着子树的所有节点都具有相同的值.

错误代码实例（错误原因if语句实际执行会”偷懒”，如果if的结果已经确定就不会算剩下的表达式了）

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */

class Solution {
public:
    /**
     * @param root: the given tree
     * @return: the number of uni-value subtrees.
     */
    int res=0;
    int countUnivalSubtrees(TreeNode * root) {
        // write your code here
        if(root==NULL) return 0;
        dfs(root);
        return res;
        
    }
    bool dfs(TreeNode * root){
        if(root->left==NULL&&root->right==NULL){
            res++;cout<<root->val<<"#1"<<endl;
            return true;
        }else if(root->left!=NULL&&root->right!=NULL){
            if(dfs(root->left)&&dfs(root->right)&&root->val==root->left->val&&root->val==root->right->val){
                res++;cout<<root->val<<"#2"<<endl;
                return true;
            }
        }else if(root->left==NULL){
            if(dfs(root->right)&&root->val==root->right->val){
                res++;cout<<root->val<<"#3"<<endl;
                return true;
            }
        }else if(root->right==NULL){
            if(dfs(root->left)&&root->val==root->left->val){
                res++;cout<<root->val<<"#4"<<endl;
                return true;
            }
        }
        return false;
    }
};

正确代码

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */

class Solution {
public:
    /**
     * @param root: the given tree
     * @return: the number of uni-value subtrees.
     */
    int res=0;
    int countUnivalSubtrees(TreeNode * root) {
        // write your code here
        if(root==NULL) return 0;
        dfs(root);
        return res;
        
    }
    bool dfs(TreeNode * root){
        if(root->left==NULL&&root->right==NULL){
            res++;cout<<root->val<<"#1"<<endl;
            return true;
        }else if(root->left!=NULL&&root->right!=NULL){
            bool flag1=dfs(root->left);
            bool flag2=dfs(root->right);
            if(flag1&&flag2&&root->val==root->left->val&&root->val==root->right->val){
                res++;cout<<root->val<<"#2"<<endl;
                return true;
            }
        }else if(root->left==NULL){
            if(dfs(root->right)&&root->val==root->right->val){
                res++;cout<<root->val<<"#3"<<endl;
                return true;
            }
        }else if(root->right==NULL){
            if(dfs(root->left)&&root->val==root->left->val){
                res++;cout<<root->val<<"#4"<<endl;
                return true;
            }
        }
        return false;
    }
};