Sum Root to Leaf Numbers

居然一次就过了！！狗眼已亮瞎。

双端队列，保存到叶子节点以来路径上的所有点即可，计算数的时候其实是用了atoi的一个实现。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    deque<int> d;
    int sumNumbers(TreeNode *root) {
        if (root == NULL)
            return 0;
            return dfs(root);
    }
    int dfs(TreeNode *root) {
        d.push_back(root->val);
        if (root->left == NULL && root->right == NULL) {
            int res = 0;
            for (int i = 0; i < d.size(); ++i) {
                res = res * 10 + d.at(i);
            }
            d.pop_back();
            return res;
        }
        int left = 0, right = 0;
        if (root->left != NULL) {
            left = dfs(root->left);
        }
        if (root->right != NULL) {
            right = dfs(root->right);
        }
        d.pop_back();
        return left + right;
    }
};

当然，总是有人想出更好的办法的……

class Solution {
    public:         
        int sumNumbers(TreeNode *root) {
            if(root==NULL)                              
                return 0;                       
            int total = 0;                                  
            dfs(root,0,total);                                          
            return total;                                                      
        }                
        void dfs(TreeNode *root,int sum,int& total){
            if(root==NULL)                                      
                return;                                 
            if(root->left==NULL&&root->right==NULL){                        
                total += sum*10+root->val;                                     
            }else{                                                           
                dfs(root->left,sum*10+root->val,total);                        
                dfs(root->right,sum*10+root->val,total);
            }                                                                  
        }                                                    
};   

http://oj.leetcode.com/problems/sum-root-to-leaf-numbers/