【LeetCode】250.Count Univalue Subtrees(Medium)解题报告

【LeetCode】250.Count Univalue Subtrees(Medium)解题报告

题目地址：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.

Solution:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 postorder
 time : O(n)
 space : O(n)
 */
class Solution {
    int res;
    public int maxPathSum(TreeNode root) {
        res = 0;
        helper(root);
        return res;
    }
    public boolean helper(TreeNode root){
        if(root == null) return true;
        boolean left = helper(root.left);
        boolean right = helper(root.right);
        if(left && right){
            if(root.left != null && root.val != root.left.val){
                return false;
            }
            if(root.right != null && root.val != root.right.val){
                return false;
            }
            res++;
            return true;
        }
    }
}

Date：2018年5月4日