【leetcode 二叉树路径和】Path Sum 和 Path Sum II

最新推荐文章于 2020-10-06 16:03:04 发布

wepon_

最新推荐文章于 2020-10-06 16:03:04 发布

阅读量1.8k

点赞数

分类专栏： Leetcode 文章标签： leetcode 二叉树路径和 DFS

本文链接：https://blog.csdn.net/u012162613/article/details/41264993

版权

Leetcode 专栏收录该内容

28 篇文章 1 订阅

订阅专栏

Path Sum

1、题目

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:
Given the below binary tree and sum = 22 ,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \      \
        7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

2、分析

这道题很简单，用递归

代码一目了然

3、代码

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool hasPathSum(TreeNode *root, int sum) {
        if(!root) return false;         //空树，返回false   
        if(!root->left && !root->right)  return root->val==sum;      //左右子树均为空，判断val是否等于sum
        return hasPathSum(root->left,sum-root->val) || hasPathSum(root->right,sum-root->val);    //递归调用hasPathSum函数
    }
};

Path Sum II

1、题目

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]
]

2、分析

递归法，对递归函数执行的逻辑要理清，画图模拟一遍有帮助于理解程序的执行流程

3、代码

/**
 * 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> current;
        pathSum(root,sum,current,result);
        return result;
    }
private:
    void pathSum(TreeNode *root,int sum,vector<int> current,vector<vector<int>> &result)
    //必须用引用&，否则传递过来的只是current、result的副本，函数递归调用结束后，这些副本在栈里面被释放掉，并未真正改变current、result
    {
        if(!root)  return;
        
        current.push_back(root->val);
        if(!root->left && !root->right)  
        {
            if(sum==root->val)   
              result.push_back(current);
        }
        
        pathSum(root->left,sum-root->val,current,result);
        pathSum(root->right,sum-root->val,current,result);
        
       current.pop_back();     //pop掉容器最后一个元素
    }
};