Many bug fixes and improvements (#1270)

* Add Ruby and Kotlin icons
Add the avatar of @curtishd

* Update README

* Synchronize zh-hant and zh versions.

* Translate the pythontutor blocks to traditional Chinese

* Fix en/mkdocs.yml

* Update the landing page of the en version.

* Fix the Dockerfile

* Refine the en landingpage

* Fix en landing page

* Reset the README.md

zh-hant/codes/rust/chapter_hashing/hash_map_chaining.rs

@@ -102,17 +102,14 @@ impl HashMapChaining {
         // 走訪桶，若遇到指定 key ，則更新對應 val 並返回
         for pair in bucket {
             if pair.key == key {
-                pair.val = val.clone();
+                pair.val = val;
                 return;
             }
         }
         let bucket = &mut self.buckets[index];
 
         // 若無該 key ，則將鍵值對新增至尾部
-        let pair = Pair {
-            key,
-            val: val.clone(),
-        };
+        let pair = Pair { key, val };
         bucket.push(pair);
         self.size += 1;
     }

zh-hant/codes/rust/chapter_tree/binary_tree_bfs.rs

@@ -14,7 +14,7 @@ use tree_node::{vec_to_tree, TreeNode};
 fn level_order(root: &Rc<RefCell<TreeNode>>) -> Vec<i32> {
     // 初始化佇列，加入根節點
     let mut que = VecDeque::new();
-    que.push_back(Rc::clone(&root));
+    que.push_back(root.clone());
     // 初始化一個串列，用於儲存走訪序列
     let mut vec = Vec::new();
 
@@ -22,10 +22,10 @@ fn level_order(root: &Rc<RefCell<TreeNode>>) -> Vec<i32> {
         // 隊列出隊
         vec.push(node.borrow().val); // 儲存節點值
         if let Some(left) = node.borrow().left.as_ref() {
-            que.push_back(Rc::clone(left)); // 左子節點入列
+            que.push_back(left.clone()); // 左子節點入列
         }
         if let Some(right) = node.borrow().right.as_ref() {
-            que.push_back(Rc::clone(right)); // 右子節點入列
+            que.push_back(right.clone()); // 右子節點入列
         };
     }
     vec

zh-hant/codes/rust/chapter_tree/binary_tree_dfs.rs

@@ -17,8 +17,8 @@ fn pre_order(root: Option<&Rc<RefCell<TreeNode>>>) -> Vec<i32> {
     if let Some(node) = root {
         // 訪問優先順序：根節點 -> 左子樹 -> 右子樹
         result.push(node.borrow().val);
-        result.append(&mut pre_order(node.borrow().left.as_ref()));
-        result.append(&mut pre_order(node.borrow().right.as_ref()));
+        result.extend(pre_order(node.borrow().left.as_ref()));
+        result.extend(pre_order(node.borrow().right.as_ref()));
     }
     result
 }
@@ -29,9 +29,9 @@ fn in_order(root: Option<&Rc<RefCell<TreeNode>>>) -> Vec<i32> {
 
     if let Some(node) = root {
         // 訪問優先順序：左子樹 -> 根節點 -> 右子樹
-        result.append(&mut in_order(node.borrow().left.as_ref()));
+        result.extend(in_order(node.borrow().left.as_ref()));
         result.push(node.borrow().val);
-        result.append(&mut in_order(node.borrow().right.as_ref()));
+        result.extend(in_order(node.borrow().right.as_ref()));
     }
     result
 }
@@ -42,8 +42,8 @@ fn post_order(root: Option<&Rc<RefCell<TreeNode>>>) -> Vec<i32> {
 
     if let Some(node) = root {
         // 訪問優先順序：左子樹 -> 右子樹 -> 根節點
-        result.append(&mut post_order(node.borrow().left.as_ref()));
-        result.append(&mut post_order(node.borrow().right.as_ref()));
+        result.extend(post_order(node.borrow().left.as_ref()));
+        result.extend(post_order(node.borrow().right.as_ref()));
         result.push(node.borrow().val);
     }
     result

zh-hant/codes/rust/include/tree_node.rs

@@ -25,7 +25,7 @@ impl TreeNode {
             height: 0,
             parent: None,
             left: None,
-            right: None
+            right: None,
         }))
     }
 }
@@ -34,7 +34,7 @@ impl TreeNode {
 macro_rules! op_vec {
     ( $( $x:expr ),* ) => {
         vec![
-            $( Option::from($x).map(|x| x) ),* 
+            $( Option::from($x).map(|x| x) ),*
         ]
     };
 }
@@ -75,9 +75,10 @@ pub fn vec_to_tree(arr: Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>> {
 fn tree_to_vec_dfs(root: Option<Rc<RefCell<TreeNode>>>, i: usize, res: &mut Vec<Option<i32>>) {
     if root.is_none() {
         return;
-    }    
+    }
     let root = root.unwrap();
-    while i >= res.len() {
+    // i + 1 is the minimum valid size to access index i
+    while res.len() < i + 1 {
         res.push(None);
     }
     res[i] = Some(root.borrow().val);