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.

题解：

bottom-up recursion. dfs返回当前root下是不是univalue tree.

Time Complexity: O(n).

Space: O(logn). height of tree.

AC Java:

 1 /**
 2  * Definition for a binary tree node.
 3  * public class TreeNode {
 4  *     int val;
 5  *     TreeNode left;
 6  *     TreeNode right;
 7  *     TreeNode(int x) { val = x; }
 8  * }
 9  */
10 class Solution {
11     public int countUnivalSubtrees(TreeNode root) {
12         int [] res = {0};
13         dfs(root, res);
14         return res[0];
15     }
16
17     private boolean dfs(TreeNode root, int [] res){
18         if(root == null){
19             return true;
20         }
21
22         boolean left = dfs(root.left, res);
23         boolean right = dfs(root.right, res);
24         if(left && right){
25             if(root.left!=null && root.left.val!=root.val){
26                 return false;
27             }
28
29             if(root.right!=null && root.right.val!=root.val){
30                 return false;
31             }
32
33             res[0]++;
34             return true;
35         }
36
37         return false;
38     }
39 }

类似Longest Univalue Path.

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/5187437.html

LeetCode 250. Count Univalue Subtrees相关推荐

250. Count Univalue Subtrees
Given a binary tree, count the number of uni-value subtrees. A Uni-value subtree means all nodes of ...
LeetCode 38. Count and Say
问题链接 LeetCode 38. Count and Say 题目解析找规律,每一个数字串是上一个数字串的"读法".比如:n=1时为"1",读作" ...
【同124】LeetCode 687. Longest Univalue Path
LeetCode 687. Longest Univalue Path Solution1: 参考链接:http://zxi.mytechroad.com/blog/tree/leetcode-687 ...
【Hard 递归动态规划回文串15】LeetCode 730. Count Different Palindromic Subsequences
LeetCode 730. Count Different Palindromic Subsequences 博客转载自:http://zxi.mytechroad.com/blog/dynamic- ...
[勇者闯LeetCode] 38. Count and Say
[勇者闯LeetCode] 38. Count and Say Description The count-and-say sequence is the sequence of integers b ...
leetcode 1925. Count Square Sum Triples（python）
描述 A square triple (a,b,c) is a triple where a, b, and c are integers and a^2 + b^2 = c^2. Given an ...
LeetCode 204. Count Primes--从一开始的质数个数--Python解法--面试算法题
题目地址:Count Primes - LeetCode Count the number of prime numbers less than a non-negative number, n. E ...
leetcode -- 357. Count Numbers with Unique Digits
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n. Examp ...
LeetCode 1885. Count Pairs in Two Arrays（二分查找）
文章目录 1. 题目 2. 解题 1. 题目 Given two integer arrays nums1 and nums2 of length n, count the pairs of indi ...

LeetCode 250. Count Univalue Subtrees

LeetCode 250. Count Univalue Subtrees相关推荐

最新文章

热门文章