257. Binary Tree Paths(easy)

Easy

99576FavoriteShare

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

 

C++:

/*
 * @Author: SourDumplings
 * @Date: 2019-08-30 19:49:21
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/binary-tree-paths/
 */
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution
{
public:
    vector<string> binaryTreePaths(TreeNode *root)
    {
        vector<int> path;
        vector<string> res;
        if (!root)
        {
            return res;
        }

        dfs(root, path, res);
        return res;
    }

    void dfs(TreeNode *root, vector<int> &path, vector<string> &res)
    {
        path.push_back(root->val);
        if (!root->left && !root->right)
        {
            record(path, res);
        }

        if (root->left)
        {
            dfs(root->left, path, res);
        }
        if (root->right)
        {
            dfs(root->right, path, res);
        }
        path.pop_back();
    }

    void record(vector<int> &path, vector<string> &res)
    {
        string temp;
        int output = 0;
        for (auto &&i : path)
        {
            if (output++)
            {
                temp += "->";
            }
            temp += to_string(i);
        }
        res.push_back(temp);
    }
};

 Java:

/*
 * @Author: SourDumplings
 * @Date: 2019-08-30 20:03:55
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/binary-tree-paths/
 */

/**
* Definition for a binary tree node.
* public class TreeNode {
*     int val;
*     TreeNode left;
*     TreeNode right;
*     TreeNode(int x) { val = x; }
* }
*/
class Solution
{
    public List<String> binaryTreePaths(TreeNode root)
    {
        List<String> res = new ArrayList<String>();
        if (root == null)
        {
            return res;
        }
        List<Integer> path = new ArrayList<Integer>();
        dfs(root, path, res);
        return res;
    }

    void dfs(TreeNode root, List<Integer> path, List<String> res)
    {
        path.add(root.val);
        if (root.left == null && root.right == null)
        {
            record(path, res);
        }
        if (root.left != null)
        {
            dfs(root.left, path, res);
        }
        if (root.right != null)
        {
            dfs(root.right, path, res);
        }
        path.remove(path.size() - 1);
    }

    void record(List<Integer> path, List<String> res)
    {
        boolean first = true;
        StringBuilder strB = new StringBuilder();
        for (Integer i : path)
        {
            if (!first)
            {
                strB.append("->");
            }
            else
                first = false;
            strB.append(i.toString());
        }
        res.add(strB.toString());
    }
}