[LeetCode] 113. Path Sum II
发布时间:2020-12-14 04:44:52 所属栏目:大数据 来源:网络整理
导读:Given a binary tree and a sum,find all root-to-leaf paths where each path‘s sum equals the given sum. Note:?A leaf is a node with no children. Example: Given the below binary tree and? sum = 22 , 5 / 4 8 / / 11 13 4 / / 7 2 5 1 Return:
Given a binary tree and a sum,find all root-to-leaf paths where each path‘s sum equals the given sum. Note:?A leaf is a node with no children. Example: Given the below binary tree and? 5 / 4 8 / / 11 13 4 / / 7 2 5 1 Return: [ [5,4,11,2],[5,8,5] ] class Solution { public: vector<vector<int>> pathSum(TreeNode* root,int sum) { vector<vector<int>> res; vector<int> out; path(root,sum,out,res); return res; } void path(TreeNode* root,int sum,vector<int> &out,vector<vector<int>> &res){ if(!root){ res={}; return; } out.push_back(root->val); if(!root->left && !root->right && root->val==sum) { res.push_back(out); } if(root->left)path(root->left,sum-root->val,out,res); if(root->right)path(root->right,res); out.pop_back(); return; } }; (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |