[自我记录]随想录刷题第十五天 | 110.平衡二叉树, 257. 二叉树的所有路径, 404.左叶子之和

 代码随想录算法打卡第十五天, 新手自我记录一下刷题历程, 仅为自我打卡使用.

---

110.平衡二叉树

再次巩固了一下高度和深度的概念

class Solution {
public:
    int getHeight(TreeNode* node) {
        if (node == nullptr) return 0;

        int leftHeight = getHeight(node->left);
        if (leftHeight == -1) return -1;
        int rightHeight = getHeight(node->right);
        if (rightHeight == -1) return -1;
        
        if (abs(leftHeight - rightHeight) > 1) 
            return -1;
        else 
            return max(leftHeight, rightHeight) + 1; 
    }

    bool isBalanced(TreeNode* root) {
        int result = getHeight(root);
        if (result == -1)
            return false;
        else
            return true;
    }
};

---

257. 二叉树的所有路径

初见回溯, 有点懵比, 这道只掌握了最简单的解法

class Solution {
public:
    void traversal(TreeNode* node, vector<int>& path, vector<string>& result) {
        path.push_back(node->val);
        if (node->left == nullptr && node->right == nullptr) {
            string res;
            for (int i = 0; i < path.size() - 1; ++i) {
                res += to_string(path[i]);
                res += "->";
            }
            res += to_string(path[path.size() - 1]);
            result.push_back(res);
            return;
        }

        if (node->left)  {
            traversal(node->left, path, result);
            path.pop_back();
        }
        if (node->right)  {
            traversal(node->right, path, result);
            path.pop_back();
        }
    }

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

---

404.左叶子之和

这道跟卡哥解法稍有不同, 我自己选了前序遍历, 加了一个bool变量判断是不是左孩子

然后无脑递归.

class Solution {
public:
    int result;
    void getSum(TreeNode* node, bool fromLeft) {
        if (node == nullptr) return;
        if (node->left == nullptr && node->right == nullptr && fromLeft) {
            result += node->val;
            return;
        }
        getSum(node->left, true);
        getSum(node->right, false);
    }
    int sumOfLeftLeaves(TreeNode* root) {
        result = 0;
        getSum(root, false);
        return result;
    }
};

---

希望明天还能坚持一天!