代码随想录——路径总和（Leetcode113）需要回顾

题目链接

递归

本题递归需要遍历整棵树，所以递归没有返回值

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public void traversal(TreeNode root, int count, List<List<Integer>> res, List<Integer> res1){
        res1.add(root.val);
        // 叶子节点且找到和为targetSum的路径
        if(root.left == null && root.right == null && count - root.val == 0){
            res.add(new ArrayList<>(res1));
            return;
        }
        // 叶子节点，和不为 targetsum，返回
        if(root.left == null && root.right == null){
            return;
        }
        if(root.left != null){
            traversal(root.left, count - root.val, res, res1);
            // 回溯
            res1.removeLast();
        }
        if(root.right != null){
            traversal(root.right, count - root.val, res, res1);
            // 回溯
            res1.removeLast();
        }
    }

    public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
        List<List<Integer>> res = new  LinkedList<List<Integer>>();
        List<Integer> res1 = new LinkedList<Integer>();
        if(root == null){
            return res;
        }
        traversal(root,targetSum,res,res1);
        return res;
    }
}

回顾本题时，请结合Leetcode112路径总和