LeetCode | 257. Binary Tree Paths

 

题目：

Given the root of a binary tree, return all root-to-leaf paths in any order.

A leaf is a node with no children.

 

Example 1:

Input: root = [1,2,3,null,5]
Output: ["1->2->5","1->3"]

Example 2:

Input: root = [1]
Output: ["1"]

 

Constraints:

• The number of nodes in the tree is in the range [1, 100].
• -100 <= Node.val <= 100

 

代码：

/**
 * 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:
    void backtrack(TreeNode* root, vector<vector<TreeNode*>>& paths, vector<TreeNode*> cur_path) {
        
        cur_path.push_back(root);
        if(root->left == NULL && root->right == NULL)
        {
            paths.push_back(cur_path);
            return;
        }
        
        if(root->left != NULL)
        {
            backtrack(root->left, paths, cur_path);
        }
        
        if(root->right != NULL)
        {
            backtrack(root->right, paths, cur_path);
        }
    }
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<string> res;
        if(root == NULL)
            return res;
        
        vector<vector<TreeNode*>> paths;
        vector<TreeNode*> cur_path;
        backtrack(root, paths, cur_path);
        
        for(int i = 0; i<paths.size(); i++)
        {
            string cur_res = "";
            for(int j = 0; j<paths[i].size() - 1; j++)
            {
                cur_res += to_string(paths[i][j]->val) + "->";
            }
            cur_res += to_string(paths[i][paths[i].size() - 1]->val);
            res.push_back(cur_res);
        }
        
        return res;
    }
};

 

又是一次AC~~~就是效率不太高哈哈哈

ps CSDN的博客编辑器又更新了，不会用233333