Open youngyangyang04 opened 5 months ago
class Solution {
public TreeNode lowestCommonAncestor(TreeNode node, TreeNode p, TreeNode q) {
if (node.val > p.val && node.val > q.val) {
return lowestCommonAncestor(node.left, p, q); // 继续往左找
} else if (node.val < p.val && node.val < q.val) {
return lowestCommonAncestor(node.right, p, q); // 继续往右找
} else {
return node; // 找到了
}
}
}
都没想到有递归法,唉, 还是太菜了
https://www.programmercarl.com/0235.%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.html