[LeetCode250]Count Univalue Subtrees
2015-11-25 07:59
357 查看
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. Hide Tags Tree
一如既往,这种题用recursion会简单很多。
根据例子,最后的node也会算做这个univalue subtree。
所以利用一个helper function判断每个left subtree 和right subtree 是不是univalue的。 如果两边都是,则判断root->val 是否等于left->val, right->val如果满足,则increase cnt, 否则返回0。
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: bool isUni(TreeNode* node, int&cnt){ if(!node) return true; bool left = isUni(node->left, cnt); bool right = isUni(node->right, cnt); if(left && right){ if(node->left && node->left->val != node->val) return false; else if(node->right && node->right->val != node->val) return false; else{ ++cnt; return true; } } return false; } int countUnivalSubtrees(TreeNode* root) { if(!root) return 0; int cnt = 0; isUni(root,cnt); return cnt; } };
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解
- LeetCode [Day 5] Longest Palindromic Substring 题解