路径总和
class Solution {
public:
void searchPath(TreeNode* root, int sum)
{
if (!root)
return;
ret.push_back(root->val);
if (root->val == sum && !root->left && !root->right)
return;
searchPath(root->left, sum - root->val);
searchPath(root->right, sum - root->val);
ret.pop_back();
return;
}
bool hasPathSum(TreeNode* root, int sum) {
if (root == NULL)
return false;
searchPath(root, sum);
if (!ret.empty())
return true;
return false;
}
private:
vector<int> ret;
};