110. 平衡二叉树 + 257. 二叉树的所有路径 + 404. 左叶子之和

最新推荐文章于 2024-09-28 10:34:40 发布

清蒸GAMMA

最新推荐文章于 2024-09-28 10:34:40 发布

阅读量43

点赞数

分类专栏： leetcode刷题记录文章标签： leetcode 算法 c++

本文链接：https://blog.csdn.net/Wang_Dechang/article/details/129914248

版权

leetcode刷题记录专栏收录该内容

13 篇文章 0 订阅

订阅专栏

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 getdepth(TreeNode* cur)
    {
        if(cur == NULL) return 0;
        return max(getdepth(cur -> left) , getdepth(cur -> right)) + 1;
    }
    bool isBalanced(TreeNode* root) {
        if(root == NULL) return 1;
        int mo = abs(getdepth(root -> left) - getdepth(root -> right));
        if(mo > 1) return 0 ;
        return isBalanced(root -> left) && isBalanced(root -> right);
    }
};

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:
    string turnstring(vector<int> temp)
    {
        string s;
        int j = 0;
        while(j < temp.size() - 1)
        {
            s += to_string(temp[j]);
            s += "->";
            j++;
        }
        s += to_string(temp[j]);
        return s;
    }
    void myfun(TreeNode* cur ,  vector<int>& temp ,vector<string>& res )
    {
        temp.push_back(cur -> val);
        if(cur -> left == NULL && cur -> right == NULL)
        {
            res.push_back(turnstring(temp));
            return;
        }
        if(cur->left)
        {
            myfun(cur->left, temp , res );
            temp.pop_back();
        } 
        if(cur -> right)
        {
            myfun(cur -> right , temp , res);
            temp.pop_back();
        }
    }
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<string> res;
        if(root == NULL) return res;
        vector<int> temp;
        myfun(root , temp, res);
        return res;
    }
};

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 res;
        if(root == NULL) return 0;
        int l = 0;
        if(root -> left != NULL && root -> left -> left == NULL && root -> left -> right == NULL)
        {
            l = root -> left -> val;
        }
        res = l + sumOfLeftLeaves(root -> left) + sumOfLeftLeaves(root -> right);
        return res;
    }
};