/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int> > ret;
vector<int> sln;
void DFS(TreeNode *root, int remain) {
if (!root) return;
sln.push_back(root->val);
if (!root->left && !root->right && root->val == remain) {
ret.push_back(sln);
} else {
DFS(root->left, remain - root->val);
DFS(root->right, remain - root->val);
}
sln.pop_back();
}
vector<vector<int> > pathSum(TreeNode *root, int sum) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
ret.clear();
sln.clear();
DFS(root, sum);
return ret;
}
};
Small Case: 12ms
Large Case: 92ms
Time: O(n)
Space: O(?)