代码随想录训练营打卡第十五天

UtsumiEr1c3

于 2024-08-31 21:41:54 发布

阅读量103

点赞数 1

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

本文链接：https://blog.csdn.net/yhxzcsq/article/details/141759203

版权

222. 完全二叉树的节点个数

普通解法, 没有用到完全二叉树的性质:

递归:

/**
 * 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 countNodes(TreeNode* root) {
        if (root == nullptr) return 0;
        int left = countNodes(root->left);
        int right = countNodes(root->right);
        return left + right + 1;
    }
};

利用完全二叉树的特性:

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 getHeight(TreeNode* root) {
        if (root == nullptr) return 0;
        int left = getHeight(root->left);
        if (left == -1) return -1;
        int right = getHeight(root->right);
        if (right == -1) return -1;
        if (abs(right - left) > 1) {
            return -1;
        } else {
            return max(left, right) + 1;
        }
    }
    bool isBalanced(TreeNode* root) {
        return getHeight(root) != -1;
    }
};

递归别细想, 一去想步骤就绕不出来了

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 traversal(TreeNode* node, vector<int>& path, vector<string>& ans) {
        path.push_back(node->val); // 最后一个节点也要加入到path中, 如果在下一个if后就直接return了
        if (node->left == nullptr && node->right == nullptr) {
            string _ans;
            for(auto p : path) {
                _ans += to_string(p);
                _ans += "->";
            }
            _ans.pop_back();
            _ans.pop_back();
            ans.push_back(_ans);
            return;
        }
        if (node->left) {
            traversal(node->left, path, ans);
            path.pop_back(); //回溯
        }
        if (node->right) {
            traversal(node->right, path, ans);
            path.pop_back(); //回溯
        }
    }

    vector<string> binaryTreePaths(TreeNode* root) {
        vector<int> path;
        vector<string> ans;
        traversal(root, path, ans);
        return ans;
    }
};