path-sum-ii.rs

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

fnmain(){}

structSolution;

// 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,
}
}
}

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

implSolution{
pubfnpath_sum(root:Option<Rc<RefCell<TreeNode>>>,target_sum:i32) -> Vec<Vec<i32>>{
matchSelf::f(root, target_sum){
Some(x) => x,
None => vec![],
}
}

fnf(root:Option<Rc<RefCell<TreeNode>>>,target_sum:i32) -> Option<Vec<Vec<i32>>>{
if root.is_none(){
returnNone;
}

let value = root.as_ref().unwrap().borrow().val;
let left = root.as_ref().unwrap().borrow_mut().left.take();
let right = root.as_ref().unwrap().borrow_mut().right.take();

if target_sum - value == 0{
if left.is_none() && right.is_none(){
returnSome(vec![vec![value]]);
}
}

letmut left = matchSelf::f(left, target_sum - value){
Some(mut x) => {
 x.iter_mut().for_each(|x| x.insert(0, value));
 x
}
None => vec![],
};

letmut right = matchSelf::f(right, target_sum - value){
Some(mut x) => {
 x.iter_mut().for_each(|x| x.insert(0, value));
 x
}
None => vec![],
};

 right.append(&mut left);
if right.len() == 0{
None
}else{
Some(right)
}
}
}