257. 二叉树的所有路径

257. 二叉树的所有路径

力扣题目链接(opens new window)

给定一个二叉树，返回所有从根节点到叶子节点的路径。

说明: 叶子节点是指没有子节点的节点。

示例: 

/**
 * 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<Integer> paths = new ArrayList<>();
        List<String> res = new ArrayList<>();
        if(root==null) return res;
        traversal(root,paths,res);
        return res;

    }
    public void traversal(TreeNode root,List<Integer>paths,List<String>res){
        paths.add(root.val);
        if(root.left==null&&root.right==null){//单条路径到头了
            StringBuilder sb = new StringBuilder();//StringBuilder sb暂存paths
            for(int i=0;i<paths.size()-1;i++){
                sb.append(paths.get(i)).append("->");//前面的size-1个后都有一个->
            }
            sb.append(paths.get(paths.size()-1));//最后一个单独处理
            res.add(sb.toString());//转成字符串
            return;
        }
        if(root.left!=null){
            traversal(root.left,paths,res);
            paths.remove(paths.size()-1);//回溯
        }
        if(root.right!=null){
            traversal(root.right,paths,res);
            paths.remove(paths.size()-1);//回溯
        }
    }
}