LintCode-剑指Offer-(376)二叉树路径求和

/**
* 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>> t;
vector<int> tmp;
GetPath(root,0,target,tmp,t);
return t;
}
void GetPath(TreeNode* node,int sumbefore,int target,
vector<int>& vecpart,vector<vector<int>>& vecall){
if (node==NULL){
return;
}
if (node->val+sumbefore==target){
vecpart.push_back(node->val);
vecall.push_back(vecpart);
return;
}
else {
vecpart.push_back(node->val);
vector<int> t1=vecpart;
vector<int> t2 = vecpart;
GetPath(node->left,node->val+sumbefore,target,t1,vecall);
GetPath(node->right,node->val+sumbefore,target,t2,vecall);
}
}
};