257. 二叉树的所有路径

一、题目描述

给你一个二叉树的根节点 root ，按 任意顺序 ，返回所有从根节点到叶子节点的路径。

叶子节点 是指没有子节点的节点。

示例 1：

输入：root = [1,2,3,null,5]
输出：["1->2->5","1->3"]

示例 2：

输入：root = [1]
输出：["1"]

二、解题

DFS解法

/**
 * 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> res = new ArrayList<String>();
        StringBuilder sb = new StringBuilder();
        dfs(root,res,sb);
        return res;
    }
    public void dfs(TreeNode root,List<String> res,StringBuilder sb){
        //终止条件
        if(root == null){
            return ;
        }
        //取当前节点的值
        int value = root.val;
        sb.append(Integer.toString(value));
        //判断是否为根节点
        if(root.left == null && root.right == null){
            res.add(sb.toString());
        }
        sb.append("->");
        int length = sb.length();
        dfs(root.left,res,sb);
        //将旧的字符串的length-新的字符串的length长度范围的字符删除
        sb.delete(length,sb.length());
        dfs(root.right,res,sb);
    }
}

/**
 * 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> res = new ArrayList<String>();
        StringBuilder sb = new StringBuilder();
        dfs(root,res,sb);
        return res;
    }
    public void dfs(TreeNode root,List<String> res,StringBuilder sb){
        //若当前节点不为空
        if(root!=null){
            //取值
            int path = root.val;
            
            sb = new StringBuilder(sb);
            sb.append(Integer.toString(path));
            //判断当前节点是不是叶子节点 是叶子节点添加到集合中，不是叶子节点就合并字符串
            if(root.left == null && root.right == null){
                res.add(sb.toString());
                
            }else{
                sb.append("->");
                dfs(root.left,res,sb);
                dfs(root.right,res,sb);
            }
        }

    }
}