[yhkee0404] WEEK 10 solutions

invert-binary-tree/yhkee0404.rs

@@ -0,0 +1,31 @@
+// 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 {
+    pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
+        if let Some(u) = &root {
+            let mut u = u.borrow_mut();
+            let v = u.left.clone();
+            u.left = Self::invert_tree(u.right.clone());
+            u.right = Self::invert_tree(v);
+        }
+        root
+    }
+}

search-in-rotated-sorted-array/yhkee0404.scala

@@ -0,0 +1,26 @@
+object Solution {
+    def search(nums: Array[Int], target: Int): Int = {
+        var l = 0
+        var r = nums.length - 1
+        while (l != r) {
+            val mid = r - ((r - l) >> 1)
+            if (nums(mid) > nums(0)) {
+                l = mid
+            } else {
+                r = mid - 1
+            }
+        }
+        l = r + 1
+        r = l + nums.length
+        while (l != r) {
+            val mid = l + ((r - l) >> 1)
+            if (nums(mid % nums.length) < target) {
+                l = mid + 1
+            } else {
+                r = mid
+            }
+        }
+        l %= nums.length
+        if (nums(l) == target) l else -1
+    }
+}