Path sum II
Q:在path sum的基础上,将结果存在vector中。
void dfs(TreeNode *root,int sum,vector<int> &set,vector<vector<int>> &result) { if(!root) return; if(root->val==sum&&!root->left&&!root->right) //leaf { set.push_back(root->val); result.push_back(set); set.pop_back(); //Attention:返回上层时,必须pop在本层push的元素 }else { set.push_back(root->val); dfs(root->left,sum-root->val,set,result); dfs(root->right,sum-root->val,set,result); set.pop_back(); //Attention:返回上层时,必须pop在本层push的元素 } } vector<vector<int> > pathSum(TreeNode *root, int sum) { // Start typing your C/C++ solution below // DO NOT write int main() function vector<vector<int>> result; vector<int> set; dfs(root,sum,set,result); return result; }