LeetCode: Path Sum II

Tingmei

于 2012-11-05 14:20:43 发布

阅读量1.9k

点赞数

CC 4.0 BY-SA版权

分类专栏： C++ 算法

本文链接：https://blog.csdn.net/Tingmei/article/details/8086309

算法同时被 2 个专栏收录

109 篇文章

订阅专栏

C++

108 篇文章

订阅专栏

本文介绍了一种算法，该算法接收一个二叉树及一个目标和作为输入，然后找出所有从根节点到叶子节点的路径，这些路径上的节点值之和等于给定的目标和。例如，在给定的二叉树中寻找和为22的所有路径。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:
    void calc(TreeNode* root, int sum, vector<vector<int> > &result,
              vector<int> &tmp)
    {
        if (root == NULL)  
        {  
            return;  
        }  
         
        tmp.push_back(root->val);
        
        int leftsum = sum - root->val;  
        // 找到sum，并且为叶子节点  
        if (leftsum == 0 && root->left == NULL && root->right == NULL)  
        {  
            result.push_back(tmp);
        }  

        calc(root->left, leftsum, result, tmp);  
        calc(root->right, leftsum, result, tmp);
        tmp.pop_back(); 
    }
    
    vector<vector<int> > pathSum(TreeNode *root, int sum) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<vector<int> > result;
        if (root == NULL) return result;
        vector<int> tmp;
        calc(root, sum, result, tmp);
        return result;
    }
};