首页 > 代码库 > Path Sum II
Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path‘s sum equals the given sum.
For example:
Given the below binary tree and sum = 22,
5 / 4 8 / / 11 13 4 / \ / 7 2 5 1
return
[ [5,4,11,2], [5,8,4,5]]
/** * 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> > pathSum(TreeNode *root, int sum) { vector<vector<int> > ans; vector<int> arr; if(root) iter(root, sum, 0, arr, ans); return ans; } void iter(TreeNode *root, int sum, int tmpsum, vector<int> arr, vector<vector<int> > &ans){ if(root->left==NULL && root->right==NULL){ tmpsum += root->val; if(tmpsum == sum){ arr.push_back(root->val); ans.push_back(arr); return; } return; } vector<int> tmp(arr); tmp.push_back(root->val); tmpsum += root->val; if(root->left){ iter(root->left, sum, tmpsum, tmp, ans); } if(root->right){ iter(root->right, sum, tmpsum, tmp, ans); } }};
Path Sum II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。