LeetCode.113. 路径总和 II

最新推荐文章于 2024-07-19 19:25:43 发布

Chamberlain T

最新推荐文章于 2024-07-19 19:25:43 发布

阅读量58

点赞数

分类专栏： LeetCode # 回溯 # 二叉树文章标签： leetcode java 算法

本文链接：https://blog.csdn.net/weixin_45867071/article/details/127011255

版权

二叉树路径总和回溯法算法递归

关键词由CSDN通过智能技术生成

LeetCode 同时被 3 个专栏收录

128 篇文章 0 订阅

订阅专栏

二叉树

38 篇文章 0 订阅

订阅专栏

回溯

23 篇文章 0 订阅

订阅专栏

113. 路径总和 II

难度：medium

同112和257：

/**
 * 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 {
    private List<List<Integer>> ans = new ArrayList<>();
    private List<Integer> path = new ArrayList<>();
    private int sum = 0;
    private int targetSum;
    public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
        if (root == null) {
            return ans;
        }
        this.targetSum = targetSum;
        backtracking(root);
        return ans;
    }

    public void backtracking(TreeNode node) {
        path.add(node.val);
        sum += node.val;
        if (node.left == null && node.right == null) {
            if (sum == targetSum) {
                ans.add(new ArrayList<>(path));
            }
            return;
        }
        if (node.left != null) {
            backtracking(node.left);
            path.remove(path.size() - 1);
            sum -= node.left.val;
        }
        if (node.right != null) {
            backtracking(node.right);
            path.remove(path.size() - 1);
            sum -= node.right.val;
        }
    }
}