代码随想录刷题第20天

最新推荐文章于 2024-09-27 15:30:00 发布

气氛组阿宇

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量44

点赞数

文章标签： leetcode 算法 c++

本文链接：https://blog.csdn.net/Bi11y/article/details/129017665

版权

20

二叉搜索树的最小绝对差

 /*
 * @lc app=leetcode.cn id=530 lang=cpp
 *
 * [530] 二叉搜索树的最小绝对差
 *
 * https://leetcode.cn/problems/minimum-absolute-difference-in-bst/description/
 *

// @lc code=start
/**
 * 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) {}
 * };
 */
#include<iostream>
#include<vector>
#include <algorithm>
using namespace std;

//   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:
vector<int> nums;
    void  transation(TreeNode* root){
        if (!root)
        {
            return;
        }
        transation(root->left);
        nums.push_back(root->val);
        transation(root->right);
    }

    int getMinimumDifference(TreeNode* root) {
        transation(root);
        int result = nums[1]-nums[0];
        for (int i = 2; i < nums.size(); i++)
        {
            result = min(result,nums[i] - nums[i-1]);
        }
        return result;
    }
};
// @lc code=end

501. 二叉搜索树中的众数

/**
 * 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:
    vector<int> nums;
    void  transation(TreeNode* root){
        if (!root)
        {
            return;
        }
        transation(root->left);
        nums.push_back(root->val);
        transation(root->right);
    }

    vector<int> findMode(TreeNode* root) {
        transation(root);
        unordered_map<int,int> map;
        for (int i = 0; i < nums.size(); i++)
        {
            map[nums[i]]++;
        }
        
        vector<int> result;
        int max = -1;
        for (auto it = map.begin(); it != map.end(); ++it)
        {
            if (it->second > max)
            {
                max = it->second;
            }
        }
        
        for (auto it = map.begin(); it != map.end(); ++it)
        {
            if (it->second == max)
            {
                result.push_back(it->first);
            }
        }
        return result;
    }
};

236. 二叉树的最近公共祖先

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if (root == q || root == p || root == NULL) return root;
        TreeNode* left = lowestCommonAncestor(root->left, p, q);
        TreeNode* right = lowestCommonAncestor(root->right, p, q);
        if (left != NULL && right != NULL) return root;

        if (left == NULL && right != NULL) return right;
        else if (left != NULL && right == NULL) return left;
        else  { 
            return NULL;
        }

    }
};