leetcode每日一题第七十七天

class Solution {
public:
    int calculateDepth(TreeNode* root) {
        int i = 0;
        if(!root) return i;
        queue<TreeNode*> q;
        q.push(root);
        while(!q.empty())
        {
            for(int j = q.size();j>0;j--)
            {
                TreeNode* tmp = q.front();
                q.pop();
                if(tmp->left) q.push(tmp->left);
                if(tmp->right) q.push(tmp->right); 
            }
            i++;
        }
        return i;

    }
};

class Solution {
public:
    bool isPerfectSquare(int num) {
        if(num < 0) return false;
        if(num == 0 || num == 1) return true;
        int j = 1;
        while(num>0)
        {
            num -= j;
            j += 2;
        }
        if(num < 0) return false;
        return true;
    }
};