lc--655:输出二叉树

_Ocean__

已于 2022-08-22 14:43:11 修改

阅读量71

点赞数 1

文章标签： leetcode 算法数据结构

于 2022-08-22 10:04:17 首次发布

本文链接：https://blog.csdn.net/zjjaibc/article/details/126460261

版权

数据结构＆算法专栏收录该内容

34 篇文章 1 订阅

订阅专栏

655. 输出二叉树 - 力扣（LeetCode）https://leetcode.cn/problems/print-binary-tree/

分析：(列数和行数都已经告知了，只需要求出height即可。)

class Solution 
{
public:
    int calDepth(TreeNode* root) 
    {
        int h = 0;
        if (root->left) 
        {
            h = max(h, calDepth(root->left) + 1);
        }
        if (root->right) 
        {
            h = max(h, calDepth(root->right) + 1);
        }
        return h;
     }

    void dfs(vector<vector<string>>& res, TreeNode* root, int r, int c, const int& height) {
        res[r][c] = to_string(root->val);
        if (root->left) 
        {
            dfs(res, root->left, r + 1, c - (1 << (height - r - 1)), height);
        }
        if (root->right) 
        {
            dfs(res, root->right, r + 1, c + (1 << (height - r - 1)), height);
        }
    }

    vector<vector<string>> printTree(TreeNode* root)     
    {
        int height = calDepth(root);
        int m = height + 1;
        int n = (1 << (height + 1)) - 1;
        vector<vector<string>> res(m, vector<string>(n, ""));
        dfs(res, root, 0, (n - 1) / 2, height);
        return res;
    }
};

class Solution 
{
public:
    int calDepth(TreeNode* root) 
    {
        int res = -1;
        queue<TreeNode*> q;
        q.push(root);
        while (!q.empty()) 
        {
            int len = q.size();
            res++;
            while (len) 
            {
                len--;
                auto t = q.front();
                q.pop();
                if (t->left) 
                {
                    q.push(t->left);
                }
                if (t->right) 
                {
                    q.push(t->right);
                }
            }
        }
        return res;
    }

    vector<vector<string>> printTree(TreeNode* root) 
    {
        int height = calDepth(root);
        int m = height + 1;
        int n = (1 << (height + 1)) - 1;
        vector<vector<string>> res(m, vector<string>(n, ""));
        queue<tuple<TreeNode*, int, int>> q;
        q.push({root, 0, (n - 1) / 2});
        while (!q.empty()) 
        {
            auto t = q.front();
            q.pop();
            int r = get<1>(t), c = get<2>(t);
            res[r][c] = to_string(get<0>(t)->val);
            if (get<0>(t)->left) 
            {
                q.push({get<0>(t)->left, r + 1, c - (1 << (height - r - 1))});
            }
            if (get<0>(t)->right) 
            {
                q.push({get<0>(t)->right, r + 1, c + (1 << (height - r - 1))});
            }
        }
        return res;
    }
};