Path Sum II Java

最新推荐文章于 2021-02-28 19:41:11 发布

Spencer_Lin

最新推荐文章于 2021-02-28 19:41:11 发布

阅读量364

点赞数

分类专栏： LeetCode BinaryTree+BSF+DFS

本文链接：https://blog.csdn.net/linxiang0591/article/details/38302595

版权

LeetCode BinaryTree+BSF+DFS 专栏收录该内容

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

Have you been asked this question in an interview

Check the coding below in detail:

/*
	Key to solve: Recursion+DFS+Backtracking
	1. Use sub list to keep track for all the path from root to leaf
	2. add satisfied path into output List
	3. Backtracking the sub list  
	 */
public class Solution {
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        List<List<Integer>> List=new ArrayList<List<Integer>>();
		 List<Integer> sub=new ArrayList<Integer>();
		 helperDFS(root,sum,List,sub);
		 return List;
	 }
	 private void helperDFS(TreeNode root,int sum,List<List<Integer>> List, List<Integer> sub ){
		 if(root==null) return;
		 
		 sub.add(root.val);
		 //the case of reach the bottom leaf of tree
		 if(sum==root.val && root.left==null && root.right==null){
			 //Insert a clone of sub into List
			 List.add(new ArrayList<Integer>(sub));
		 }
		 //Recursively through left and right sub tree
		 helperDFS(root.left,sum-root.val,List,sub);
		 helperDFS(root.right,sum-root.val,List,sub);
		 //use Backtracking to deal with if next move is not fit, go back
		 sub.remove(sub.size()-1);
	}
}