LeetCode.257. 二叉树的所有路径

257. 二叉树的所有路径

 

难度：easy

 一道披着二叉树外衣的回溯题，不过回溯的过程本来就是可以抽象成二叉树结构的。

/**
 * 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> result = new ArrayList<>();
    public List<Integer> path = new ArrayList<>();

    public List<String> binaryTreePaths(TreeNode root) {
        if (root == null) {
            return result;
        }
        backtracking(root);
        return result;
    }

    public void backtracking(TreeNode node) {
        // add过程放前面，收集路径时才会包含叶子节点
        path.add(node.val);
        // 回溯到叶子节点时，收集该条路径的结果，需要把List转化为String类型
        if (node.left == null && node.right == null) {
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < path.size() - 1; i++) {
                sb.append(path.get(i)).append("->");
            }
            sb.append(path.get(path.size() - 1));
            result.add(sb.toString());
            return;
        }
        if (node.left != null) {
            backtracking(node.left);
            path.remove(path.size() - 1);
        }
        if (node.right != null) {
            backtracking(node.right);
            path.remove(path.size() - 1);

        }
    }
}