【二叉树】112. Path Sum

---

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:
Given the below binary tree and  sum = 22,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \      \
        7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

先做了II再做这个就简单了,但是不要再写另一个dfs函数了，直接调用自己：

/**
 * 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 hasPathSum(TreeNode* root, int sum) {
        if(!root)return false;
        if(!(root->left)&&!(root->right)&&(sum==root->val))
            return 1;
        return hasPathSum(root->left,sum-root->val)||hasPathSum(root->right,sum-root->val);
    }
};

这个题不像II，用BFS也很简单，两个队列一个处理指针，另一个储存每步得到的和：

class Solution {
public:
    bool hasPathSum(TreeNode* root, int sum) {
        if(!root)return false;
        queue<TreeNode*> q;
        queue<int> sum_q;
        q.push(root);//enqueue
        sum_q.push(root->val);//enqueue
        while(!q.empty()){
            TreeNode* p=q.front();
            int tot=sum_q.front();
            q.pop();//dequeue
            sum_q.pop();//dequeue        
            if(!(p->left)&&!(p->right)&&(sum==tot))
                return true;
            if(p->left){
                q.push(p->left);
                sum_q.push(tot+p->left->val);
            }
            if(p->right){
                q.push(p->right);
                sum_q.push(tot+p->right->val);
            }
        }
        return false;
    }
};

AC了，美滋滋。