算法训练DAY17LeetCode110.平衡二叉树257. 二叉树的所有路径 404.左叶子之和

Don Vito Corleone512

已于 2023-07-23 14:00:02 修改

阅读量87

点赞数

文章标签：算法 c++ 数据结构 leetcode

于 2023-07-14 20:44:44 首次发布

本文链接：https://blog.csdn.net/weixin_66826367/article/details/131722960

版权

LeetCode110.平衡二叉树

class Solution {
public:
    int getdepth(TreeNode* root){
        if(root==NULL) return 0;
        int lef = getdepth(root->left);
        if(lef==-1)return -1;
        int rig = getdepth(root->right);
        if(rig==-1)return -1;
        return abs(lef-rig)>1?-1:1+max(lef,rig);
    }
    bool isBalanced(TreeNode* root) {
        if(root==NULL) return true;
        int result = getdepth(root);
        return result==-1?false:true;
    }
};

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:
    void getpath(TreeNode* root,vector<int>& path,vector<string>& result){
        path.push_back(root->val);
        if(root->left==NULL&&root->right==NULL){
            string s;
            for(int i=0;i<path.size()-1;i++){
                s+=to_string(path[i]);
                s+="->";
            }
            s+=to_string(path[path.size()-1]);
            result.push_back(s);
            return;
        }
        if(root->left){
            getpath(root->left,path,result);
            path.pop_back();
        }
        if(root->right){
            getpath(root->right,path,result);
            path.pop_back();
        }

    }
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<int> path;
        vector<string> result;
        if(root==NULL)return result;
        getpath(root,path,result);
        return result;
    }
};

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:
    void getleftnode(TreeNode* root,int& result){
        if(root==NULL)return;
        TreeNode* cur = root->left;
        if(cur!=NULL&&cur->left==NULL&&cur->right==NULL){
            result+=cur->val;
        }
        getleftnode(root->left,result);
        getleftnode(root->right,result);
    }
    int sumOfLeftLeaves(TreeNode* root) {
        int result=0;
        getleftnode(root,result);
        return result;
    }
};