-
Notifications
You must be signed in to change notification settings - Fork 1
/
572.subtree-of-another-tree.rs
57 lines (53 loc) · 1.6 KB
/
572.subtree-of-another-tree.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/*
* @lc app=leetcode id=572 lang=rust
*
* [572] Subtree of Another Tree
*/
// @lc code=start
// Definition for a binary tree node.
// #[derive(Debug, PartialEq, Eq)]
// pub struct TreeNode {
// pub val: i32,
// pub left: Option<Rc<RefCell<TreeNode>>>,
// pub right: Option<Rc<RefCell<TreeNode>>>,
// }
//
// impl TreeNode {
// #[inline]
// pub fn new(val: i32) -> Self {
// TreeNode {
// val,
// left: None,
// right: None
// }
// }
// }
use std::rc::Rc;
use std::cell::RefCell;
impl Solution {
pub fn is_subtree(s: Option<Rc<RefCell<TreeNode>>>, t: Option<Rc<RefCell<TreeNode>>>) -> bool {
if let Some(s_rc_node) = s.clone() {
let tree_node = s_rc_node.borrow();
Self::is_sametree(s.clone(), t.clone()) ||
Self::is_subtree(tree_node.left.clone(), t.clone()) ||
Self::is_subtree(tree_node.right.clone(), t.clone())
} else {
return t.is_none();
}
}
pub fn is_sametree(a: Option<Rc<RefCell<TreeNode>>>, b: Option<Rc<RefCell<TreeNode>>>) -> bool {
match (a, b) {
(None, None) => true,
(Some(_), None) => false,
(None, Some(_)) => false,
(Some(x), Some(y)) => {
let xnode = x.borrow();
let ynode = y.borrow();
xnode.val == ynode.val &&
Self::is_sametree(xnode.left.clone(), ynode.left.clone()) &&
Self::is_sametree(xnode.right.clone(), ynode.right.clone())
}
}
}
}
// @lc code=end