代码随想录day15补

最新推荐文章于 2024-10-09 22:28:58 发布

乌拉！哒哒哒哒哒

最新推荐文章于 2024-10-09 22:28:58 发布

阅读量143

点赞数 2

分类专栏：代码随想录打卡记录文章标签：算法 leetcode

本文链接：https://blog.csdn.net/sunke123456789/article/details/136610725

版权

代码随想录打卡记录专栏收录该内容

30 篇文章 0 订阅

订阅专栏

102

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        queue<TreeNode*> que;
        if (root != NULL) que.push(root);
        vector<vector<int>> result;
        while (!que.empty()) {
            int size = que.size();
            vector<int> vec;
            for (int i = 0; i < size; i++) {
                TreeNode* node = que.front();
                que.pop();
                vec.push_back(node->val);
                if (node->left) que.push(node->left);
                if (node->right) que.push(node->right);
            }
            result.push_back(vec);
        }
        return result;
    }

};

递归法

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    void order(TreeNode* cur, vector<vector<int>>& res, int deepth){
        if(cur == nullptr) return;
        if(res.size() == deepth) {
            res.push_back(vector<int> ());
        }
        res[deepth].push_back(cur-> val);
        order(cur->left, res, deepth+1);
        order(cur->right,res,deepth+1);

    }
    vector<vector<int>> levelOrder(TreeNode* root) {
        int deepth = 0;
        vector<vector<int>> res;
        order(root,res,deepth);
        return res;
     
    }

};

107
反转上题目
199

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<int> rightSideView(TreeNode* root) {
         queue<TreeNode*> que;
        if (root != NULL) que.push(root);
        vector<int> result;
        while (!que.empty()) {
            int size = que.size();
            for (int i = 0; i < size; i++) {
                TreeNode* node = que.front();
                que.pop();
                if (i == (size - 1))
                { result.push_back(node->val); }
                if (node->left) que.push(node->left);
                if (node->right) que.push(node->right);
            }
        }
        return result;

    }
};