// 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 {
    fn dfs(root: Option<Rc<RefCell<TreeNode>>>, v: &mut Vec<i32>) {
        if let Some(node) = root {
            if !node.borrow().left.is_none() {
                Self::dfs(node.borrow().left.clone(), v);
            }
            if node.borrow().left.is_none() && node.borrow().right.is_none() {
                v.push(node.borrow().val);
            }
            if !node.borrow().right.is_none() {
                Self::dfs(node.borrow().right.clone(), v);
            }
        }
    }
    pub fn leaf_similar(root1: Option<Rc<RefCell<TreeNode>>>, root2: Option<Rc<RefCell<TreeNode>>>) -> bool {
        let (mut v1, mut v2) = (vec![], vec![]);
        Self::dfs(root1, &mut v1);
        Self::dfs(root2, &mut v2);
        return v1 == v2;
    }
}

impl Solution {
    pub fn min_eating_speed(piles: Vec<i32>, h: i32) -> i32 {
        let (mut l, mut r) = (1, *piles.iter().max().unwrap());

        while l < r {
            let mid = l + (r - l) / 2;
            let mut total = 0;
            for val in &piles {
                total += (*val as f32 / mid as f32).ceil() as i32;
            }
            if total > h {
                l = mid + 1;
            } else {
                r = mid;
            }
        }

        return l;
    }
}

impl Solution {
    pub fn is_monotonic(a: Vec<i32>) -> bool {
        if a.len() == 1 {
            return true;
        }
        
        let mut flag = 0;
        for i in 1..a.len() {
            if a[i - 1] == a[i] {
                continue;
            }
            let mut cur = 0;
            if a[i - 1] < a[i] {
                cur = 1;
            } else {
                cur = 2;
            }
            if flag != 0 && flag != cur {
                return false;
            }
            flag = cur;
        }
        return true;
    }
}