129. Sum Root to Leaf Numbers LeetCode
2016-02-16 17:35
435 查看
题意：求二叉树所有根到叶子组成的数字之和。
题解：DFS。
题解：DFS。
class Solution {
public:
int ans;
void dfs(int num,TreeNode* root)
{
if(root->left == NULL && root->right == NULL)
ans += num * 10 + root->val;
if(root->left != NULL)
dfs(num * 10 + root->val,root->left);
if(root->right != NULL)
dfs(num * 10 + root->val,root->right);
}
int sumNumbers(TreeNode* root) {
ans = 0;
if(root == NULL) return ans;
dfs(0,root);
return ans;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [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 题解