Leetcode 113. Path Sum II

最新推荐文章于 2023-11-14 10:36:43 发布

SnailTyan

最新推荐文章于 2023-11-14 10:36:43 发布

阅读量219

点赞数

分类专栏： Leetcode 文章标签： Leetcode

本文链接：https://blog.csdn.net/Quincuntial/article/details/81290080

版权

Leetcode 同时被 2 个专栏收录

409 篇文章 18 订阅

订阅专栏

Algorithm

260 篇文章 2 订阅

订阅专栏

文章作者：Tyan
博客：noahsnail.com | CSDN | 简书

1. Description

Path Sum II

2. Solution

2.1 Recursive

Version 1

/**
 * Definition for a binary tree node.
 * 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>> result;
        if(!root) {
            return result;
        }   
        vector<int> path;
        tranverseTree(root, sum, result, path);
        return result;
    }

     void tranverseTree(TreeNode* root, int sum, vector<vector<int>>& result, vector<int> path) {
        path.push_back(root->val);
        if(root->val == sum && root->left == NULL && root->right == NULL) {
            result.push_back(path);
        }
        if(root->left) {
            tranverseTree(root->left, sum - root->val, result, path);
        }
        if(root->right) {
            tranverseTree(root->right, sum - root->val, result, path);
        }
    }
};

Version 2

/**
 * Definition for a binary tree node.
 * 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>> result;
        if(!root) {
            return result;
        }   
        vector<int> path;
        tranverseTree(root, sum, result, path);
        return result;
    }

     void tranverseTree(TreeNode* root, int sum, vector<vector<int>>& result, vector<int>& path) {
        path.push_back(root->val);
        if(root->val == sum && root->left == NULL && root->right == NULL) {
            result.push_back(path);
            path.pop_back();
            return;
        }
        if(root->left) {
            tranverseTree(root->left, sum - root->val, result, path);
        }
        if(root->right) {
            tranverseTree(root->right, sum - root->val, result, path);
        }
        path.pop_back();
    }
};