DAY 17

最新推荐文章于 2024-06-23 05:48:02 发布

qq_41512555

最新推荐文章于 2024-06-23 05:48:02 发布

阅读量28

点赞数

文章标签： leetcode 算法深度优先

本文链接：https://blog.csdn.net/qq_41512555/article/details/127622158

版权

DAY 17

110. 平衡二叉树

/**
 * 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:
   
    // int left = 0;
    // int right = 0;
    bool flag = true ;
    int dfs(TreeNode* root)
    {
       
       if(!root) return true;
       int left = dfs(root->left) + 1;
       int right = dfs(root->right) + 1;
       if(abs(left - right) > 1) flag = false;
       return max(left,right);

    }
    bool isBalanced(TreeNode* root) {
        if(!root) return true;
        dfs(root);
        return flag; 



    }
};

257. 二叉树的所有路径

/**
 * 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> res;
    vector<string> str;
    vector<string> binaryTreePaths(TreeNode* root) {
        dfs(root);
        return str;

    }
    void dfs(TreeNode* root)
    {
        res.push_back(root->val);
        if(!root->left && !root->right)
        {
            string line = to_string(res[0]);
            for(int i = 1;i < res.size();i++)
            {
                line += "->" + to_string(res[i]);
            }
            str.push_back(line); 
        }
        else{
            if(root->left)
            {
                dfs(root->left);
                res.pop_back();
            }
            if(root->right)
            {
                dfs(root->right);
                res.pop_back();
            }
        }
        
    }

};

404. 左叶子之和

/**
 * 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:
    int sumOfLeftLeaves(TreeNode* root) {
        int sum = 0;
        if(!root) return 0;
        queue<TreeNode*> que;
        que.push(root);
        while(que.size())
        {
            int len = que.size();
            while(len--)
            {
                auto t = que.front();
                que.pop();
                if(t->left)
                {
                    que.push(t->left);
                    if(!t->left->left && !t->left->right) sum += t->left->val;
                }
                if(t->right)
                {
                    que.push(t->right);
                }

            }
        }
        return sum;

    }
};