LintCode 二叉树路径求和

//AC 的答案

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     * @param root the root of binary tree
     * @param target an integer
     * @return all valid paths
     */
    vector<vector<int>> binaryTreePathSum(TreeNode *root, int target) {
        // Write your code here
        vector<vector<int>> res;
        if(root == NULL)
        return res;
        vector<int> path;
        int currSum = 0;
        findPath(root,target,path,currSum,res);
        return res;
        
    }
    void findPath(TreeNode* root, int target, vector<int> &path, int currSum, vector<vector<int>> &res )
    {
        currSum += root->val;
        path.push_back(root->val);
        bool isLeaf = root->left == NULL && root->right == NULL;
        if(currSum == target && isLeaf)
        {
            //for(vector<int>::iterator it = path.begin();it != path.end(); ++it)
            //cout<<*it<<"->";
            res.push_back(path);
        }
        if(root->left != NULL)
            findPath(root->left,target,path,currSum,res);
        if(root->right != NULL)
            findPath(root->right,target,path,currSum,res);
        path.pop_back();
    }
};

给定一个二叉树，找出所有路径中各节点相加总和等于给定  目标值 的路径。

一个有效的路径，指的是从根节点到叶节点的路径。

您在真实的面试中是否遇到过这个题？ 

Yes

样例

给定一个二叉树，和 目标值 = 5:

     1
    / \
   2   4
  / \
 2   3

返回：

[
  [1, 2, 2],
  [1, 4]
]