LintCode:二叉树的路径和

描述：

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

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

样例

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

     1
    / \
   2   4
  / \
 2   3

返回：

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

/**
 * 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>> N_vec;
    
    vector<vector<int>> binaryTreePathSum(TreeNode *root, int target) {
        // Write your code here
        vector<vector<int>> n_vec;
        vector<int> vec;
        N_vec = n_vec;
        TravelGet(root,0,target,vec);
        return N_vec;
    }
    
    void TravelGet(TreeNode *root,int grade,int target,vector<int> vec) {
        if(!root) {
            return ;
        }
        vec.push_back(root -> val);
        if(root -> left == NULL && root -> right == NULL) {
            if(grade + root -> val == target) {
                N_vec.push_back(vec);
            }
            return;
        }
        TravelGet(root -> left,grade + root -> val,target,vec);
        TravelGet(root -> right,grade + root -> val,target,vec);
    }
};