剑指 Offer day17|64. 求1+2+…+n，68 - I. 二叉搜索树的最近公共祖先，68 - II. 二叉树的最近公共祖先

剑指 Offer 64. 求1+2+…+n

题目描述：剑指 Offer 64. 求1+2+…+n

class Solution {
public:
    int res = 0;
    int sumNums(int n) {
        
        n > 1 && sumNums(n - 1);
        res += n;
        return res;
    }
};

剑指 Offer 68 - I. 二叉搜索树的最近公共祖先

题目描述：剑指 Offer 68 - I. 二叉搜索树的最近公共祖先

class Solution {
public:
    int pp, qq;
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root->val < p->val && root->val < q->val){
            return lowestCommonAncestor(root->right, p, q);
        }
        if(root->val > p->val && root->val > q->val){
            return lowestCommonAncestor(root->left, p, q);
        }
        return root;
    }
};

剑指 Offer 68 - II. 二叉树的最近公共祖先

题目描述：剑指 Offer 68 - II. 二叉树的最近公共祖先
题解思路：二叉树的最近公共祖先

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root == NULL || 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;

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