从零开始的LC刷题(59): Lowest Common Ancestor of a Binary Search Tree 最小共同祖先

原题：

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”

Given binary search tree:  root = [6,2,8,0,4,7,9,null,null,3,5]

 

Example 1:

Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
Output: 6
Explanation: The LCA of nodes 2 and 8 is 6.

Example 2:

Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 4
Output: 2
Explanation: The LCA of nodes 2 and 4 is 2, since a node can be a descendant of itself according to the LCA definition.

 

就是找到给定两个节点的共同最小祖先，先想到的是递归算法，但是仅凭返回值不好判断到底有没有找到这个值所以设置了一个标志，结果：

Success

Runtime: 28 ms, faster than 99.20% of C++ online submissions for Lowest Common Ancestor of a Binary Search Tree.

Memory Usage: 25.8 MB, less than 33.46% of C++ online submissions for Lowest Common Ancestor of a Binary Search Tree.

代码：

/**
 * 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:
    bool fd=false;
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root==nullptr){return nullptr;}
        TreeNode *l=lowestCommonAncestor(root->left,p,q);
        if(fd==true){return l;}
        TreeNode *r=lowestCommonAncestor(root->right,p,q);
        if(fd==true){return r;}
        if((l==p||r==p||root==p)&&(l==q||r==q||root==q)){fd=true;return root;}
        else if(l==p||r==p||root==p){return p;}
        else if(l==q||r==q|root==q){return q;}
        return nullptr;
    }
};

然后发现是二叉搜索树，那就简单了呀，直接二叉搜索就行，当两个值一大一小时就是所求节点了，结果：

Success

Runtime: 28 ms, faster than 99.20% of C++ online submissions for Lowest Common Ancestor of a Binary Search Tree.

Memory Usage: 25.8 MB, less than 51.06% of C++ online submissions for Lowest Common Ancestor of a Binary Search Tree.

/**
 * 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(p->val>root->val&&q->val>root->val){
            return lowestCommonAncestor(root->right,p,q);
        }
        else if(p->val<root->val&&q->val<root->val){
            return lowestCommonAncestor(root->left,p,q);
        }
        else return root;
    }
};

这样循环的算法也好写了，结果：

Success

Runtime: 36 ms, faster than 91.25% of C++ online submissions for Lowest Common Ancestor of a Binary Search Tree.

Memory Usage: 25.8 MB, less than 62.47% of C++ online submissions for Lowest Common Ancestor of a Binary Search Tree.

代码：

/**
 * 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) {
        TreeNode* temp=root;
        while(true){
            if(q->val>temp->val&&p->val>temp->val){
                temp=temp->right;
                continue;
            }
            else if(q->val<temp->val&&p->val<temp->val){
                temp=temp->left;
                continue;
            }
            else return temp;
        }
    }
};