Go最新【LeetCode刷题日记】[104(1)，三年Golang开发-优快云博客

本文链接：https://blog.youkuaiyun.com/2401_84924979/article/details/138985413

既有适合小白学习的零基础资料，也有适合3年以上经验的小伙伴深入学习提升的进阶课程，涵盖了95%以上Go语言开发知识点，真正体系化！

由于文件比较多，这里只是将部分目录截图出来，全套包含大厂面经、学习笔记、源码讲义、实战项目、大纲路线、讲解视频，并且后续会持续更新

C++

class Solution {
public:
    int maxDepth(TreeNode\* root) {
        if (root == nullptr) return 0;
        queue<TreeNode\*> Q;
        Q.push(root);
        int ans = 0;
        while (!Q.empty()) {
            int sz = Q.size();
            while (sz > 0) {
                TreeNode\* node = Q.front();Q.pop();
                if (node->left) Q.push(node->left);
                if (node->right) Q.push(node->right);
                sz -= 1;
            }
            ans += 1;
        } 
        return ans;
    }
};

struct QueNode {
    struct TreeNode \*p;
    struct QueNode \*next;
};

void init(struct QueNode \*\*p, struct TreeNode \*t) {
    (\*p) = (struct QueNode \*)malloc(sizeof(struct QueNode));
    (\*p)->p = t;
    (\*p)->next = NULL;
}

int maxDepth(struct TreeNode \*root) {
    if (root == NULL) return 0;
    struct QueNode \*left, \*right;
    init(&left, root);
    right = left;
    int ans = 0, sz = 1, tmp = 0;
    while (left != NULL) {
        tmp = 0;
        while (sz > 0) {
            if (left->p->left != NULL) {
                init(&right->next, left->p->left);
                right = right->next;
                tmp++;
            }
            if (left->p->right != NULL) {
                init(&right->next, left->p->right);
                right = right->next;
                tmp++;
            }
            left = left->next;
            sz--;
        }
        sz += tmp;
        ans++;
    }
    return ans;
}