zoukankan      html  css  js  c++  java
  • Leetcode:559. N叉树的最大深度

    Leetcode:559. N叉树的最大深度

    Leetcode:559. N叉树的最大深度

    Talk is cheap . Show me the code .

    /*
    // Definition for a Node.
    class Node {
    public:
        int val;
        vector<Node*> children;
    
        Node() {}
    
        Node(int _val) {
            val = _val;
        }
    
        Node(int _val, vector<Node*> _children) {
            val = _val;
            children = _children;
        }
    };
    */
    class Solution {
    public:
        int maxDepth(Node* root) {
            queue<Node*> que;
            if(root!=NULL) que.push(root);
            Node* temp;
            int dep=0,size=0;
            while(!que.empty()){
                size=que.size();
                while(size--){
                    temp=que.front();
                    que.pop();
                    for(int i=0;i<temp->children.size();i++){
                        que.push(temp->children[i]);
                    }
                }
                dep++;
            }
            return dep;
        }
    };
    
  • 相关阅读:
    js18
    js17
    js16
    js15
    js14
    js13
    js12
    js11
    八月二十三的php
    八月二十二的php
  • 原文地址:https://www.cnblogs.com/cell-coder/p/12380349.html
Copyright © 2011-2022 走看看