Day 19 胜利属于达瓦里氏!
题目1 剑指 Offer 64. 求1+2+…+n
题目2 剑指 Offer 68 - I. 二叉搜索树的最近公共祖先
题目3 剑指 Offer 68 - II. 二叉树的最近公共祖先
1. 剑指 Offer 64. 求1+2+…+n
思路: 采用与运算 与运算具备短路运算的性质 如果前一半是错的将不会执行后半段的部分
class Solution {
public:
int sumNums(int n) {
int res = n;
(n > 0) && (res += sumNums(n - 1));
return res;
}
};
2.剑指 Offer 68 - I. 二叉搜索树的最近公共祖先
思路 : 核心思路 首先根据二叉搜索树的性质进行递归左右子树
如果p 节点 和 q 节点 分别在左右子树 那么 最近公共祖先就是 root
如果p q 节节点位于同一颗子树 先找到的就是最近公共祖先
/**
* 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) {
int x = root -> val;
if(p -> val < x && q -> val < x){
return lowestCommonAncestor(root -> left , p, q);
}
if(p -> val > x && q -> val > x){
return lowestCommonAncestor(root -> right, p, q);
}
return root;
}
};
3. 剑指 Offer 68 - II. 二叉树的最近公共祖先
思路:分类·讨论
/**
* 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 == NULL) return root;
if(root -> val == p -> val) return p;
if(root -> val == q -> val) return q;
auto left = lowestCommonAncestor(root -> left , p, q);
auto right = lowestCommonAncestor(root -> right, p, q);
if(left && right) return root;
if(left) return left;
return right;
}
};