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/kotlin/chapter_computational_complexity/recursion.kt

@@ -74,4 +74,4 @@ fun main() {
 
     res = fib(n)
     println("\n費波那契數列的第 $n 項為 $res")
-}
+}

zh-hant/codes/kotlin/chapter_computational_complexity/space_complexity.kt

@@ -60,9 +60,9 @@ fun linearRecur(n: Int) {
 /* 平方階 */
 fun quadratic(n: Int) {
     // 矩陣佔用 O(n^2) 空間
-    val numMatrix: Array<Array<Int>?> = arrayOfNulls(n)
+    val numMatrix = arrayOfNulls<Array<Int>?>(n)
     // 二維串列佔用 O(n^2) 空間
-    val numList: MutableList<MutableList<Int>> = arrayListOf()
+    val numList = mutableListOf<MutableList<Int>>()
     for (i in 0..<n) {
         val tmp = mutableListOf<Int>()
         for (j in 0..<n) {
@@ -104,6 +104,6 @@ fun main() {
     quadratic(n)
     quadraticRecur(n)
     // 指數階
-    val root: TreeNode? = buildTree(n)
+    val root = buildTree(n)
     printTree(root)
 }

zh-hant/codes/kotlin/chapter_computational_complexity/time_complexity.kt

@@ -9,7 +9,7 @@ package chapter_computational_complexity.time_complexity
 /* 常數階 */
 fun constant(n: Int): Int {
     var count = 0
-    val size = 10_0000
+    val size = 100000
     for (i in 0..<size)
         count++
     return count
@@ -48,7 +48,7 @@ fun quadratic(n: Int): Int {
 
 /* 平方階（泡沫排序） */
 fun bubbleSort(nums: IntArray): Int {
-    var count = 0
+    var count = 0 // 計數器
     // 外迴圈：未排序區間為 [0, i]
     for (i in nums.size - 1 downTo 1) {
         // 內迴圈：將未排序區間 [0, i] 中的最大元素交換至該區間的最右端
@@ -109,7 +109,7 @@ fun linearLogRecur(n: Int): Int {
     if (n <= 1)
         return 1
     var count = linearLogRecur(n / 2) + linearLogRecur(n / 2)
-    for (i in 0..<n.toInt()) {
+    for (i in 0..<n) {
         count++
     }
     return count
@@ -133,7 +133,7 @@ fun main() {
     val n = 8
     println("輸入資料大小 n = $n")
 
-    var count: Int = constant(n)
+    var count = constant(n)
     println("常數階的操作數量 = $count")
 
     count = linear(n)
@@ -144,7 +144,8 @@ fun main() {
     count = quadratic(n)
     println("平方階的操作數量 = $count")
     val nums = IntArray(n)
-    for (i in 0..<n) nums[i] = n - i // [n,n-1,...,2,1]
+    for (i in 0..<n)
+        nums[i] = n - i // [n,n-1,...,2,1]
     count = bubbleSort(nums)
     println("平方階（泡沫排序）的操作數量 = $count")
 

zh-hant/codes/kotlin/chapter_computational_complexity/worst_best_time_complexity.kt

@@ -13,10 +13,9 @@ fun randomNumbers(n: Int): Array<Int?> {
     for (i in 0..<n) {
         nums[i] = i + 1
     }
-    // 隨機打亂陣列元素
     val mutableList = nums.toMutableList()
+    // 隨機打亂陣列元素
     mutableList.shuffle()
-    // Integer[] -> int[]
     val res = arrayOfNulls<Int>(n)
     for (i in 0..<n) {
         res[i] = mutableList[i]
@@ -39,8 +38,8 @@ fun findOne(nums: Array<Int?>): Int {
 fun main() {
     for (i in 0..9) {
         val n = 100
-        val nums: Array<Int?> = randomNumbers(n)
-        val index: Int = findOne(nums)
+        val nums = randomNumbers(n)
+        val index = findOne(nums)
         println("\n陣列 [ 1, 2, ..., n ] 被打亂後 = ${nums.contentToString()}")
         println("數字 1 的索引為 $index")
     }