LeetCode 250. Count Univalue Subtrees（单值子树）

原题网址：https://leetcode.com/problems/count-univalue-subtrees/

Given a binary tree, count the number of uni-value subtrees.

A Uni-value subtree means all nodes of the subtree have the same value.

For example:
Given binary tree,

              5
             / \
            1   5
           / \   \
          5   5   5

return 4.

思路：递归+分治策略，如果子树是unival，则返回unival的值，否则返回空。当前节点根据子树返回的unival可以判断是否和当前节点相等。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    private int count;
    private Integer unival(TreeNode root) {
        boolean unival = true;
        if (root.left != null) {
            Integer left = unival(root.left);
            if (left == null || root.val != left) unival = false;
        }
        if (root.right != null) {
            Integer right = unival(root.right);
            if (right == null || root.val != right) unival = false;
        }
        if (!unival) return null;
        count ++;
        return root.val;
    }
    public int countUnivalSubtrees(TreeNode root) {
        if (root == null) return 0;
        unival(root);
        return count;
    }
}

类似方法：递归函数返回是否uni

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    private int count;
    private boolean unival(TreeNode root) {
        boolean uni = true;
        if (root.left != null) uni &= unival(root.left) && root.val == root.left.val;
        if (root.right != null) uni &= unival(root.right) && root.val == root.right.val;
        if (uni) count ++;
        return uni;
    }
    public int countUnivalSubtrees(TreeNode root) {
        if (root == null) return 0;
        unival(root);
        return count;
    }
}