Leetcode 250. Count Univalue Subtrees

方法1: 这道题思路其实不是很难想，基本也是recursion来做，我的recursion思路其实和lc的官方思路是一样的，但是我不是很明白为什么lc把这个思路叫做dfs。我刚开始看到是要用dfs来做我以为是要iterate & stack来做。后来才发现这个dfs其实就是我想的recursion。至于他为什么叫做dfs，我觉得还是因为要一步步往下recurson，直到碰到整个树的leaf才算碰到了base case，然后才开始backtracking。下面我给出两个代码，一个是high vote代码，我觉得写的非常好，第二个是我自己写的代码，虽然也实现了，但是比较冗长，但是思路是一致的。时间复杂n，空间复杂height of the tree -> logn。

/**
 * 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;
    
    public int countUnivalSubtrees(TreeNode root) {
        count = 0;
        helper(root);
        return count;
    }
    
    public boolean helper(TreeNode root) {
        if (root == null) return true;
            
        boolean left = helper(root.left);
        boolean right = helper(root.right);
        
        if (left && right && 
           (root.left == null || root.val == root.left.val) && 
           (root.right == null || root.val == root.right.val)) {
            count++;
            return true;
        }
        
        return false;
    }
}

/**
 * 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;
    public int countUnivalSubtrees(TreeNode root) {
        return helper(root,1).get(1);
    }
    
    public List<Integer> helper(TreeNode root, int level){
        List<Integer> list = new ArrayList<>();
        int count = 0;
        if(root == null){
            list.add(0); list.add(0); return list;
        } 
        if(root.left == null && root.right == null){
            list.add(0); list.add(1); return list;
        }  
        TreeNode left = root.left;
        TreeNode right = root.right;
        List list1 = helper(left,level+1);
        List list2 = helper(right,level+1);
        count += (int)list1.get(1) + (int)list2.get(1);
        if((int)list1.get(0) == 0 && (int)list2.get(0) == 0 && (left == null || root.val == left.val) && (right == null ||root.val == right.val)){
            list.add(0);
            list.add(count + 1);  
        }else{
            list.add(-1);
            list.add(count);
        }
        return list;
    }
}

这边需要注意一下我的代码level其实都不需要，没有用。但是我懒得改了。

总结：

• 无