use std::cmp;

impl Solution {
    pub fn min_height_shelves(books: Vec<Vec<i32>>, shelf_width: i32) -> i32 {
        let (n, mut i, mut j) = (books.len(), 0, 0);
        let mut dp = vec![std::i32::MAX; n];
        while i < n {
            let (mut w, mut h) = (0, 0);
            j = i;
            while j < n {
                w += books[j][0];
                if w > shelf_width {
                    break;
                }
                h = cmp::max(h, books[j][1]);
                let val = match i {
                    0 => 0,
                    _ => dp[i - 1]
                };
                dp[j] = cmp::min(dp[j], val + h);
                j += 1;
            }
            i += 1;
        }

        return dp[n - 1];
    }
}

impl Solution {
    pub fn defang_i_paddr(address: String) -> String {
        let mut ans = "".to_string();
        for c in address.chars() {
            if c != '.' {
                ans.push(c);

            } else { 
                ans.push_str("[.]"); 
            }
        }
        return ans;
    }
}

impl Solution {
    fn is_leap_year(y: i32) -> bool {
        return (y % 4 == 0 && y % 100 != 0) || (y % 400 == 0);
    }

    pub fn number_of_days(y: i32, m: i32) -> i32 {
        let feb = match Self::is_leap_year(y)  {
            true => 29,
            false => 28
        };
        let ans = vec![31,feb,31,30,31,30,31,31,30,31,30,31];
        return ans[m as usize - 1];
    }
}