Sum Root to Leaf Numbers
二叉树每个从根节点到叶子节点的路径都代表一个整数,计算所有整数的和
只需要遍历一遍整棵数即可,需要注意必须是到达叶子节点
代码如下
/**
* 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:
int sumNumbers(TreeNode* root) {
int sum = 0;
int cur =