DAY 21

最新推荐文章于 2024-07-02 10:58:29 发布

qq_41512555

最新推荐文章于 2024-07-02 10:58:29 发布

阅读量56

点赞数

文章标签： leetcode 深度优先算法

本文链接：https://blog.csdn.net/qq_41512555/article/details/127702556

版权

DAY 21

530. 二叉搜索树的最小绝对差

/**
 * 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> res;
    void dfs(TreeNode* root)
    {
        if(!root) return ;
        dfs(root->left);
        res.push_back(root->val);
        dfs(root->right);

    }
    int getMinimumDifference(TreeNode* root) {
        int nums = INT_MAX;
        dfs(root);
        for(int i = 1;i < res.size();i++)
        {
            //用前减后，用后减前会出现问题
            nums = min(nums,res[i] - res[i - 1]);
        }
        return nums;
    }
};

501. 二叉搜索树中的众数 - 力扣（Leetcode）

/**
 * 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> res;
    void dfs(TreeNode* root)
    {
        if(!root) return;
        dfs(root->left);
        res.push_back(root->val);
        dfs(root->right);

    }
    bool static cmp (const pair<int, int>& a, const pair<int, int>& b) 
    {
    	return a.second > b.second; // 按照频率从大到小排序
    }
    vector<int> findMode(TreeNode* root) {
        dfs(root);
        unordered_map<int,int> counts;
        vector<int> nums;
        int cnt = 0;
        int ma = 0;
       	for (auto x : res)
	    {
		    ++counts[x];
	    }
        vector<pair<int,int>> vec(counts.begin(),counts.end());
        sort(vec.begin(),vec.end(),cmp);
        nums.push_back(vec[0].first);
        for(int i = 1;i < vec.size();i++)
        {
            if(vec[i].second == vec[0].second)
                {
                    nums.push_back(vec[i].first);
                }
            else
                break;
        }

        
        return nums;
        
        


    }
};

236. 二叉树的最近公共祖先 - 力扣（Leetcode）

/**
 * 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 || root == q || root == p) return root;
        //因为是递归，使用函数后认为左右子树已经算出了结果
        auto left = lowestCommonAncestor(root->left,p,q);
        auto right = lowestCommonAncestor(root->right,p,q);
        //有俩结果，p和q一人一个，那么祖先为root
        if(left && right) return root;
        if(left && !right) return left;
        if(!left && right) return right;
        return NULL; 

    }
};