Re: [LeetCode] 刷到面試 Grind169 C++
235. Lowest Common Ancestor of a Binary Search Tree easy題
越來越熟練囉
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root->val > p->val && root->val > q->val){
return lowestCommonAncestor(root->left, p, q);
}
else if (root->val < q->val && root->val < p->val){
return lowestCommonAncestor(root->right, p, q);
}
return root;
}
};
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 223.137.157.124 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1679197896.A.125.html
推
03/19 11:52,
2年前
, 1F
03/19 11:52, 1F
推
03/19 11:52,
2年前
, 2F
03/19 11:52, 2F
討論串 (同標題文章)
完整討論串 (本文為第 11 之 14 篇)：