linked-list-in-binary-tree.rs

#![allow(dead_code, unused, unused_variables, non_snake_case)]

use std::cell::RefCell;
use std::rc::Rc;

fnmain(){}

structSolution;

// Definition for singly-linked list.
#[derive(PartialEq,Eq,Clone,Debug)]
pubstructListNode{
pubval:i32,
pubnext:Option<Box<ListNode>>,
}

implListNode{
#[inline]
fnnew(val:i32) -> Self{
ListNode{next:None, val }
}
}

// Definition for a binary tree node.
#[derive(Debug,PartialEq,Eq)]
pubstructTreeNode{
pubval:i32,
publeft:Option<Rc<RefCell<TreeNode>>>,
pubright:Option<Rc<RefCell<TreeNode>>>,
}

implTreeNode{
#[inline]
pubfnnew(val:i32) -> Self{
TreeNode{
 val,
left:None,
right:None,
}
}
}

implSolution{
pubfnis_sub_path(head:Option<Box<ListNode>>,root:Option<Rc<RefCell<TreeNode>>>) -> bool{
if root.is_none(){
returnfalse;
}

Self::dfs(head.clone(), root.clone())
 || Self::is_sub_path(
 head.clone(),
 root.clone().and_then(|x| x.borrow().left.clone()),
)
 || Self::is_sub_path(
 head.clone(),
 root.clone().and_then(|x| x.borrow().right.clone()),
)
}

fndfs(head:Option<Box<ListNode>>,root:Option<Rc<RefCell<TreeNode>>>) -> bool{
match(head.clone(), root.clone()){
(Some(h),Some(r)) => {
if h.val != r.borrow().val{
returnfalse;
}

Self::dfs(h.next.clone(), r.borrow().left.clone())
 || Self::dfs(h.next.clone(), r.borrow().right.clone())
}
(Some(h),None) => false,
 _ => true,
}
}
}