8-14-2020

Author: safrannn

src/_0101_symmetric_tree.rs

@@ -0,0 +1,42 @@
+struct Solution;
+use crate::util::*;
+use std::cell::RefCell;
+use std::rc::Rc;
+impl Solution {
+    pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
+        if let Some(node) = root {
+            let node = node.borrow();
+            return Self::is_mirror(&node.left, &node.right);
+        }
+        true
+    }
+
+    fn is_mirror(
+        node1: &Option<Rc<RefCell<TreeNode>>>,
+        node2: &Option<Rc<RefCell<TreeNode>>>,
+    ) -> bool {
+        match (node1, node2) {
+            (Some(n1), Some(n2)) => {
+                if n1.borrow().val != n2.borrow().val {
+                    return false;
+                }
+                return Self::is_mirror(&n1.borrow().left, &n2.borrow().right)
+                    && Self::is_mirror(&n1.borrow().right, &n2.borrow().left);
+            }
+            (None, None) => true,
+            _ => false,
+        }
+    }
+}
+
+#[test]
+fn test() {
+    assert_eq!(
+        Solution::is_symmetric(tree!(
+            1,
+            tree!(2, tree!(3), tree!(4)),
+            tree!(2, tree!(4), tree!(3))
+        )),
+        true
+    );
+}

src/_0234_palindrome_linked_list.rs

@@ -0,0 +1,27 @@
+struct Solution;
+use rustgym::util::*;
+
+impl Solution {
+    pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
+        let mut h_numbers: Vec<i32> = vec![];
+        let mut h_next = &head;
+
+        while let Some(h_node) = h_next {
+            h_numbers.push(h_node.val);
+            h_next = &h_node.next;
+        }
+        let length = h_numbers.len();
+        for i in 0..length / 2 {
+            if h_numbers[i] != h_numbers[length - 1 - i] {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+
+#[test]
+fn test() {
+    assert_eq!(Solution::is_palindrome(list!(1, 2)), false);
+    assert_eq!(Solution::is_palindrome(list!(1, 2, 2, 1)), true);
+}

src/lib.rs

@@ -62,6 +62,8 @@ mod _0083_remove_duplicates_from_sorted_list;
 //
 mod _0088_merge_sorted_array;
 //
+mod _0101_symmetric_tree;
+//
 mod _0121_best_time_to_buy_and_sell_stock;
 //
 mod _0125_valid_palindrome;
@@ -94,6 +96,8 @@ mod _0210_course_schedule_ii;
 //
 mod _0219_contains_duplicate_ii;
 //
+mod _0234_palindrome_linked_list;
+//
 mod _0238_product_of_array_except_self;
 //
 mod _0242_valid_anagram;
@@ -148,6 +152,8 @@ mod _0520_detect_capital;
 //
 mod _0532_kdiff_pairs_in_an_array;
 //
+mod _0543_diameter_of_binary_tree;
+//
 mod _0556_next_greater_element_iii;
 //
 mod _0557_reverse_words_in_a_string_iii;