LeetCode Binary Tree Paths

Nightonke

于 2016-01-06 23:21:59 发布

阅读量348

点赞数

分类专栏： leetcode 文章标签： leetcode Binary PreOrder

本文链接：https://blog.csdn.net/u012925008/article/details/50472424

版权

leetcode 专栏收录该内容

219 篇文章 0 订阅

订阅专栏

题目

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”]

代码

class Solution {
public:
    vector<string> binaryTreePaths(TreeNode* root) {
        road.clear();
        answers.clear();
        preOrder(root);
        return answers;
    }
private:
    vector<int> road;
    vector<string> answers;

    void preOrder(TreeNode * root) {
        if (!root) return;
        road.push_back(root->val);
        if (root->left) preOrder(root->left);
        if (root->right) preOrder(root->right);
        if (!root->left && !root->right) {
            string answer = "";
            for (int i = 0; i < road.size(); i++) {
                if (i > 0) answer += "->";
                answer += intToString(road[i]);
            }
            if (answer != "") answers.push_back(answer);
        }
        road.pop_back();
    }

    string intToString(int i) {
        string answer = "";
        bool negative = i < 0;
        if (negative) i = -i;
        do {
            answer += i % 10 + '0';
            i /= 10;
        } while (i);
        reverse(answer.begin(), answer.end());
        return negative ? "-" + answer : answer;
    }
};