摘要：
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_bac... 阅读全文
摘要：
Q: 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 andsum = 22, 5 / \ 4 8 / / \ 11 13 4 / ... 阅读全文