算法训练营day21

题目部分

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

用双指针记录比存在数组里重新遍历好

class Solution {
public:
    int getMinimumDifference(TreeNode* root) {
        getDif(root);
        return result;
    }
    void getDif(TreeNode* root){
        if(root == nullptr)return;

        getDif(root->left);
        if(pre!=nullptr){
            int dif = root->val-pre->val;
            if(dif<result)result = dif;
        }

        pre = root;
        getDif(root->right);
        return;
    }
private:
    TreeNode* pre;
    int result=INT_MAX;
};

501.二叉搜索树中的众数

用map存下来再转数组排序代价太大，用技巧可以只要一次遍历

class Solution {
public:
    vector<int> findMode(TreeNode* root) {
        traversal(root);
        return result;
    }
    void traversal(TreeNode* root){
        if(root == nullptr)return;
        traversal(root->left);
        if(pre==nullptr)Fre = 1;
        else if(pre->val == root->val)Fre++;
        else Fre = 1;
        if(Fre==maxFre)result.push_back(root->val);
        if(Fre>maxFre){
            maxFre = Fre;
            result.clear();
            result.push_back(root->val);
        }
        pre = root;
        traversal(root->right);
        return;
    }
private:
    int Fre = 0;
    int maxFre = 0;
    vector<int> result;
    TreeNode* pre;
};

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

注意有第二种情况，但是代码中容易顺带把第二种情况解决了

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root == NULL)return NULL;
        if(root==p||root==q)return root;
        TreeNode* left = lowestCommonAncestor(root->left,p,q);
        TreeNode* right = lowestCommonAncestor(root->right,p,q);
        if(left!=NULL&&right!=NULL)return root;
        else if(left!=NULL&&right==NULL)return left;
        else if(left==NULL&&right!=NULL)return right;
        else return NULL;
    }
};