代码随想录算法训练营第二十天|依旧是二叉树

654. 最大二叉树

class Solution {
public:
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        if (nums.size() == 0) return nullptr;
        if (nums.size() == 1) {
            TreeNode* root = new TreeNode(nums[0]);
            return root;
        }
        int max = nums[0];
        int maxLoc = 0;
        for (int i = 0; i < nums.size(); ++i) {
            if (nums[i] > max) {
                max = nums[i];
                maxLoc = i;
            }
        }
        if (maxLoc == 0) {
            TreeNode* root = new TreeNode(nums[maxLoc]);
            vector<int> numsRight(nums.begin() + 1, nums.end());
            root->right = constructMaximumBinaryTree(numsRight);
            return root;
        }
        if (maxLoc == nums.size() - 1) {
            TreeNode* root = new TreeNode(nums[maxLoc]);
            vector<int> numsLeft(nums.begin(), nums.end() - 1);
            root->left = constructMaximumBinaryTree(numsLeft);
            return root;
        }
        TreeNode* root = new TreeNode(nums[maxLoc]);
        vector<int> numsLeft(nums.begin(), nums.begin() + maxLoc);
        vector<int> numsRight(nums.begin() + maxLoc + 1, nums.end());
        root->left = constructMaximumBinaryTree(numsLeft);
        root->right = constructMaximumBinaryTree(numsRight);
        return root;
    }
};

617. 合并二叉树

class Solution {
public:
    TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {
        if (!root1 && !root2) return nullptr;
        if (root1 && !root2) return root1;
        if (!root1 && root2) return root2;
        root2->val += root1->val;
        root2->left = mergeTrees(root1->left, root2->left);
        root2->right = mergeTrees(root1->right, root2->right);
        return root2;
    }
};

700. 二叉搜索树中的搜索

class Solution {
public:
    TreeNode* searchBST(TreeNode* root, int val) {
        if (root == nullptr) return nullptr;
        if (root->val == val) return root;
        else if (root->val > val) {
            return searchBST(root->left, val);
        }
        else {
            return searchBST(root->right, val);
        }
    }
};

注意二叉搜索树的概念

98. 验证二叉搜索树

class Solution {
public:
    vector<int> nums;
    void traverse(TreeNode* root) {
        if (root == nullptr) return;
        traverse(root->left);
        nums.push_back(root->val);
        traverse(root->right);
    }
    bool isValidBST(TreeNode* root) {
        traverse(root);
        for (int i = 0; i < nums.size() - 1; i++) {
            if (nums[i] >= nums[i + 1]) return false;
        }
        return true;
    }
};

加油，感觉有点甲流了，身体发热