LeetCode - 257 - Binary Tree Paths

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

For example, given the following binary tree:

   1
 /   \
2     3
 \
  5

All root-to-leaf paths are:

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

递归真的好，好，写！嗯。。。我我我，我决定写几天递归了orzzzzzzz

时间复杂度O(n)，空间复杂度O(n)

/**
 * 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> ans;
    vector<string> binaryTreePaths(TreeNode* root) {
        if (!root) return ans;
        solve(root, "");
        return ans;
    }
    void solve(TreeNode* root, string s) {
        if (s != "") s += "->";
        s += to_string(root->val);
        if (!root->left && !root->right) {
            ans.push_back(s);
            return;
        }
        if (root->left) solve(root->left, s);
        if (root->right) solve(root->right, s);
        return;
    }
};

然额还是挣扎不过内心，写了个非递归的。。。时间复杂度O(n)，空间复杂度O(字符串长度和,nh)

/**
 * 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<string> ans;
        if (!root) return ans;
        stack<TreeNode*> s;
        stack<string> s2;
        s.push(root);
        s2.push("");
        while (!s.empty()) {
            TreeNode* cur = s.top();
            s.pop();
            string curs = s2.top();
            s2.pop();
            if (!cur->left && !cur->right) {
                ans.push_back(curs + to_string(cur->val));
            }
            if (cur->left) {
                s.push(cur->left);
                s2.push(curs + to_string(cur->val) + "->");
            }
            if (cur->right) {
                s.push(cur->right);
                s2.push(curs + to_string(cur->val) + "->");
            }
        }
        return ans;
    }
};