Datawhale-LeetCode编程实践组队学习Task15

231. 2的幂

class Solution {
public:
    bool isPowerOfTwo(int n) {
        if (n <= 0) return false;
        return (n&(n - 1)) == 0;
    }
};

235. 二叉搜索树的最近公共祖先

/**
 * 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* ans;
        while (root != nullptr)
        {
            if (root->val == p->val || root->val == q->val)
            {
                ans = root;
                break;
            }
            if (root->val < p-> val && root->val > q->val)
            {
                ans = root;
                break;
            }
            if (root->val > p->val && root->val < q->val)
            {
                ans = root;
                break;
            }
            else
            {
                if (root->val < p->val)
                {
                    root = root->right;
                }
                else
                {
                    root = root->left;
                }
            }
        }

        return ans;
    }
};

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 {
private:
    TreeNode* ans;
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        dfs(root, p, q);
        return ans;
    }

    bool dfs(TreeNode* root, TreeNode* p, TreeNode* q)
    {
        if (root == NULL)
        {
            return false;
        }
        bool lson = dfs(root->left, p, q);
        bool rson = dfs(root->right, p, q);
        if ((lson && rson) || ((root->val == p->val || root->val == q->val) && (lson || rson)))
        {
            ans = root;
        }
        
        return lson || rson || root->val == p->val || root->val == q->val;
    }
};