Sum Root to Leaf Numbers
2013-04-10 17:51
316 查看
和剑指offer里和为K的相似,这儿使用了霍纳法则来做的,很方便。
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: int sum,res; int sumNumbers(TreeNode *root) { // Start typing your C/C++ solution below // DO NOT write int main() function if(!root) return 0; res=sum=0; dfs(root); return res; } void dfs(TreeNode *root){ if(!root) return; sum=sum*10+root->val; if(!root->left&&!root->right) res+=sum;//这儿不能return if(root->left!=NULL) dfs(root->left); if(root->right!=NULL) dfs(root->right); sum=(sum-root->val)/10;//回溯 } };
相关文章推荐
- [LeetCode129] Sum Root to Leaf Numbers
- LeetCode Sum Root to Leaf Numbers
- 129. Sum Root to Leaf Numbers LeetCode
- [Leetcode] Sum Root to Leaf Numbers
- LeetCode之Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers ——Leetcode系列(十七)
- LeetCode[Tree]: Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- sum-root-to-leaf-numbers
- [leetcode] Sum Root to Leaf Numbers
- [LeetCode] Sum Root to Leaf Numbers
- 129. Sum Root to Leaf Numbers
- LeetCode--Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- LeetCode(Sum Root to Leaf Numbers)
- 【LeetCode】 Sum Root to Leaf Numbers
- [LeetCode] Sum Root to Leaf Numbers
- LeetCode129 Sum Root to Leaf Numbers
- 129. Sum Root to Leaf Numbers
- 【Leetcode长征系列】Sum Root to Leaf Numbers