二叉树--路径和为sum的路径方案

最新推荐文章于 2022-10-08 13:39:55 发布

独孤金泽

最新推荐文章于 2022-10-08 13:39:55 发布

阅读量328

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/qq_35747066/article/details/99685464

本文介绍了一种解决二叉树中所有根到叶子节点路径和等于给定值问题的算法。通过深度优先搜索(DFS)遍历二叉树，记录符合条件的路径。示例中，对于给定的二叉树和目标和为22，返回了所有可能的路径。

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

113. Path Sum II

Medium

100636FavoriteShare

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:

[
   [5,4,11,2],
   [5,8,4,5]
]

class Solution {
private:
    vector<vector<int>> result;
    int score;
public:
    vector<vector<int>> pathSum(TreeNode* root, int sum)
    {
        score = sum;
        if(root == NULL){return result;}
        vector<int> tmp;
        dfs(root,tmp,0);
        return result;
    }
    void dfs(TreeNode *root,vector<int> tmp,int sum)
    {
        tmp.push_back(root->val);
        sum += root->val;
        if(root->left == NULL && root->right == NULL && sum == score){result.push_back(tmp);}
        if(root->left != NULL){dfs(root->left,tmp,sum);}
        if(root->right != NULL){dfs(root->right,tmp,sum);}
    }
};