代码随想录 day16

最新推荐文章于 2024-08-23 09:59:49 发布

ggggtxgt

最新推荐文章于 2024-08-23 09:59:49 发布

阅读量62

点赞数

文章标签： leetcode 算法 c++

本文链接：https://blog.csdn.net/ggggtxgt/article/details/127692622

版权

104. 二叉树的最大深度

层序遍历

class Solution {
public:
    int maxDepth(TreeNode* root) {
        if (nullptr == root) return 0;
        queue<TreeNode*> que;
        que.push(root);
        int maxDepth = 0;

        while (!que.empty()) {
            int size = que.size();
            for (int i = 0; i < size; i++) {
                TreeNode *cur = que.front();
                que.pop();
                if (cur->left) que.push(cur->left);
                if (cur->right)que.push(cur->right);
            }
            maxDepth++;
        }
        return maxDepth;
    }
};

递归

class Solution {
public:
    int maxDepth(TreeNode* root) {
        if (nullptr == root) return 0;
        int left = maxDepth(root->left);   // 计算左子树的高度
        int right = maxDepth(root->right); // 计算右子树的高度
        return max(left, right) + 1;
    }
};

559.N 叉树的最大深度

层序遍历

class Solution {
public:
    int maxDepth(Node* root) {
        if (nullptr == root) return 0;
        queue<Node*> que;
        que.push(root);
        int maxDepth = 0;

        while (!que.empty()) {
            int size = que.size();
            maxDepth++;
            for (int i = 0; i < size; i++) {
                Node *cur = que.front();
                que.pop();
                for (auto child : cur->children) {
                    que.push(child);
                }
            }
        }
        return maxDepth;
    }
};

111.二叉树的最小深度

递归

class Solution {
public:
    int traversal(TreeNode *cur) {
        if (nullptr == cur) return 0;
        int left = traversal(cur->left);
        int right = traversal(cur->right);
        
        if (cur->left == nullptr && cur->right != nullptr) return right + 1;
        if (cur->left != nullptr && cur->right == nullptr) return left + 1;
        
        return 1 + min(left, right);
    }
    int minDepth(TreeNode* root) {
        return traversal(root);
    }
};

层序遍历

class Solution {
public:
    int minDepth(TreeNode* root) {
        if (nullptr == root) return 0;
        queue<TreeNode*> que;
        que.push(root);
        int minDepth = 0;

        while (!que.empty()) {
            int size = que.size();
            minDepth++;
            for (int i = 0; i < size; i++) {
                TreeNode *cur = que.front();
                que.pop();
                if (!cur->left && !cur->right) return minDepth;
                if (cur->left) que.push(cur->left);
                if (cur->right)que.push(cur->right);
            }
        }
        return minDepth;
    }
};

222.完全二叉树的节点个数

递归

class Solution {
public:
    int traversal(TreeNode *cur) {
        if (nullptr == cur) return 0;
        int left = traversal(cur->left);
        int right = traversal(cur->right);
        int sum = 1 + left + right; // 此处的 1 是根节点
        return sum;
    }
    int countNodes(TreeNode* root) {
        return traversal(root);
    }
};

层序遍历

class Solution {
public:
    int countNodes(TreeNode* root) {
        if (nullptr == root) return 0;
        queue<TreeNode *> que;
        que.push(root);
        int sum = 0;

        while (!que.empty()) {
            int size = que.size();
            sum += size;
            for (int i = 0; i < size; i++) {
                TreeNode *cur = que.front();
                que.pop();
                if (cur->left) que.push(cur->left);
                if (cur->right)que.push(cur->right);
            }
        }
        return sum;
    }
};