Leetcode257-Binary Tree Paths(二叉树的所有路径)

最新推荐文章于 2022-06-11 21:58:14 发布

PerryJennings

最新推荐文章于 2022-06-11 21:58:14 发布

阅读量141

点赞数

分类专栏： Leetcode 文章标签： Leetcode Tree Alogrithm Devide Conquer

本文链接：https://blog.csdn.net/PerryJennings/article/details/83213076

版权

Leetcode 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Leetcode257-Binary Tree Paths(二叉树的所有路径)

问题描述：

Given a binary tree, return all root-to-leaf paths.

Note: A leaf is a node with no children.

Example:

Input:

1
/
2 3

5

Output: [“1->2->5”, “1->3”]

Explanation: All root-to-leaf paths are: 1->2->5, 1->3

解法一：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    
    // Simple Recursive Algorithm
    public List<String> binaryTreePaths(TreeNode root) {
        List<String> res = new ArrayList<>();
        if(root == null){
            return res;
        }
        searchPath(root, "", res);
        return res;
    }
    private void searchPath(TreeNode root, String local, List<String> res){
        local += root.val;
        if(root.left == null && root.right == null){
            res.add(local);
            return;
        }
        if(root.left != null){
            searchPath(root.left, local + "->", res);
        }
        if(root.right != null){
            searchPath(root.right, local + "->", res);
        }
    }

解法二：分治算法

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
 public class Solution{
	// Divide Conquer
   public List<String> binaryTreePaths(TreeNode root) {
        List<String> paths = new LinkedList<>();
        if(root == null) 
            return paths;
        if(root.left == null && root.right == null){
            paths.add(root.val + "");
            return paths;
        }
        for(String path : binaryTreePaths(root.left)) {
            paths.add(root.val + "->" + path);
        }
        for(String path : binaryTreePaths(root.right)) {
            paths.add(root.val + "->" + path);
        }
        return paths;
    }
}