Path Sum II(medium)

最新推荐文章于 2021-02-16 23:55:13 发布

yingzijk

最新推荐文章于 2021-02-16 23:55:13 发布

阅读量282

点赞数

分类专栏： leetcode 文章标签： Path Sum IImedium

本文链接：https://blog.csdn.net/haihaa/article/details/51495238

版权

leetcode 专栏收录该内容

66 篇文章 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]
]

Subscribe to see which companies asked this question

[题意]

求出满足sum是22的所有路径

[分析]

利用递归的方法，当左右子节点都是NULL的时候能够判断当前节点是叶子节点。根据Path Sum相比，这道题是要求出路径，故在找到满足的路径之后，不能直接返回，而是将其添加到一个ArrayList<ArrayList<int>>中。在查找的途中，每经过一个结点，先使用一个ArrayList<int>将该路径中的所有结点记录下来。

[实现]

/** 
 * Definition for a binary tree node. 
 * public class TreeNode { 
 *     int val; 
 *     TreeNode left; 
 *     TreeNode right; 
 *     TreeNode(int x) { val = x; } 
 * } 
 */ 
public
public class Solution {
    ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
    ArrayList<Integer> path = new ArrayList<Integer>();
	public ArrayList<ArrayList<Integer>> pathSum(TreeNode root, int sum) {
        getSum(root, 0, sum);
        return result;
    }
	public void getSum(TreeNode root, int sum, int target){
		if(root == null) return;
		sum+= root.val;
		path.add(root.val);
		if(root.left == null && root.right == null && sum== target)
			result.add(new ArrayList<>(path));
		getSum(root.left, sum, target);
		getSum(root.right, sum, target);
		sum-=root.val;
		path.remove(path.size()-1);
		return;
	}
}

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