Leetcode: Path Sum II

最新推荐文章于 2024-09-08 15:12:17 发布

YMHH

最新推荐文章于 2024-09-08 15:12:17 发布

阅读量601

点赞数

分类专栏： Leetcode 文章标签： leetcode 递归遍历二叉树

本文链接：https://blog.csdn.net/ymhhym/article/details/17468723

版权

Leetcode 专栏收录该内容

249 篇文章 0 订阅

订阅专栏

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> > paths;
        vector<int> path;
        if (root == NULL) {
            return paths;
        }
        
        findSum(root, sum, path, paths);
        
        return paths;
    }
    
    void findSum(TreeNode *root, int sum, vector<int>& path, vector<vector<int> >& paths) {
        path.push_back(root->val);
        if (root->left == NULL && root->right == NULL) {
            if (root->val == sum) {
                paths.push_back(path);
            }
        }
        
        if (root->left != NULL) {
            findSum(root->left, sum - root->val, path, paths);
        }
        if (root->right != NULL) {
            findSum(root->right, sum - root->val, path, paths);
        }
        path.pop_back();
    }
};

===================第二次====================

/**
 * 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>> result;
        vector<int> path;
        pathSumUtil(result, path, root, sum);
        
        return result;
    }
    
    void pathSumUtil(vector<vector<int>>& result, vector<int>& path, TreeNode *root, int sum) {
        if (root == NULL) {
            return;
        }
        
        path.push_back(root->val);
        if (root->left == NULL && root->right == NULL) {
            if (root->val == sum) {
                result.push_back(path);
            }
        }
        else
        {
            pathSumUtil(result, path, root->left, sum - root->val);
            pathSumUtil(result, path, root->right, sum - root->val);
        }
        path.pop_back();
    }
};

非递归的解法，类似后序遍历。

/**
 * 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>> result;
        vector<int> path;
        
        stack<TreeNode*> nodes;
        TreeNode *prev = NULL;
        while (root != NULL || !nodes.empty()) {
            while (root != NULL) {
                nodes.push(root);
                path.push_back(root->val);
                sum -= root->val;
                root = root->left;
            }
            if (!nodes.empty()) {
                root = nodes.top();
                if (root->right == NULL || root->right == prev)
                {
                    if (root->left == NULL && root->right == NULL && sum == 0) {
                        result.push_back(path);
                    }
                    nodes.pop();
                    path.pop_back();
                    sum += root->val;
                    prev = root;
                    root = NULL;
                }
                else {
                    root = root->right;
                }
            }
        }
        
        return result;
    }
};