(刷题）257.二叉树的所有路径

最新推荐文章于 2024-07-19 17:37:28 发布

海滩上的猪

最新推荐文章于 2024-07-19 17:37:28 发布

阅读量159

点赞数 5

分类专栏：刷题专栏文章标签： java leetcode

本文链接：https://blog.csdn.net/weixin_46580819/article/details/136890918

版权

刷题专栏专栏收录该内容

32 篇文章 0 订阅

订阅专栏

题目

在这里插入图片描述

解析

迭代和回溯共生

/**
 * 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 List<String> binaryTreePaths(TreeNode root) {
        List<String> resList = new ArrayList<>();
        if (root == null) {
            return resList;
        }
        List<Integer> paths = new ArrayList<>();
        deal(root, resList, paths);
        return resList;
    }

    public void deal(TreeNode node, List<String> resList, List<Integer> paths) {
        paths.add(node.val); // 前序遍历
        if (node.left == null && node.right == null) { // 遇到叶子节点返回
            StringBuffer sb = new StringBuffer(); // 加快拼接速度
            for (int i = 0; i < paths.size() - 1; i++) {
                sb.append(paths.get(i)).append("->");
            }
            sb.append(paths.get(paths.size() - 1));
            resList.add(sb.toString());
            return;
        }
        if (node.left != null) {
            deal(node.left, resList, paths); // 迭代
            paths.remove(paths.size() - 1); // 回溯
        }
        if (node.right != null) {
            deal(node.right, resList, paths);
            paths.remove(paths.size() - 1);
        }

    }

}