题解 | #二叉搜索树的最近公共祖先# | Rust

/**
 * #[derive(PartialEq, Eq, Debug, Clone)]
 * pub struct TreeNode {
 *     pub val: i32,
 *     pub left: Option<Box<TreeNode>>,
 *     pub right: Option<Box<TreeNode>>,
 * }
 *
 * impl TreeNode {
 *     #[inline]
 *     fn new(val: i32) -> Self {
 *         TreeNode {
 *             val: val,
 *             left: None,
 *             right: None,
 *         }
 *     }
 * }
 */
struct Solution{

}

impl Solution {
    fn new() -> Self {
        Solution{}
    }

    /**
    * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
    *
    * 
        * @param root TreeNode类 
        * @param p int整型 
        * @param q int整型 
        * @return int整型
    */
    pub fn lowestCommonAncestor(&self, root: Option<Box<TreeNode>>, p: i32, q: i32) -> i32 {
        let (min_val, max_val) = (std::cmp::min(p, q), std::cmp::max(p, q));
        if root.as_ref().unwrap().val > max_val {
            return Solution::lowestCommonAncestor(self, root.as_ref().unwrap().left.clone(), min_val, max_val);
        }
        if root.as_ref().unwrap().val < min_val {
            return Solution::lowestCommonAncestor(self, root.as_ref().unwrap().right.clone(), min_val, max_val);
        }
        return root.as_ref().unwrap().val;
    }
}