leetcode 113. Path Sum II

class Solution {public:vector<vector<int>> pathSum(TreeNode* root, int sum){if (root == nullptr){return{};}target = sum;process(root, {}, 0);return res;}private:int target;vector<vector<int>> res;void process(TreeNode* root, vector<int> temp, int now){temp.push_back(root->val);if (root->left == nullptr && root->right == nullptr){if (now + root->val == target){res.push_back(temp);}return;}if (root->left){process(root->left, temp, now + root->val);}if (root->right){process(root->right, temp, now + root->val);}}};