LeetCode 257 Binary Tree Paths (DFS)

最新推荐文章于 2020-08-19 09:09:35 发布

_TCgogogo_

最新推荐文章于 2020-08-19 09:09:35 发布

阅读量657

点赞数

分类专栏： Leetcode Easy LeetCode 文章标签： leetcode DFS

本文链接：https://blog.csdn.net/tc_to_top/article/details/77479150

版权

LeetCode 同时被 2 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Easy

48 篇文章 0 订阅

订阅专栏

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

For example, given the following binary tree:

All root-to-leaf paths are:

["1->2->5", "1->3"]

题目分析：DFS即可（16ms 击败76%）

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