feat: add the solution of Count and Say(038) with kotlin.

Author: relish-wang

README.md

@@ -38,7 +38,7 @@
 | [027][027-question] | [Remove Element][027-tips]                                   | [✅][027-java] |              | [✅][027-kotlin] |
 | [028][028-question] | [Implement strStr()][028-tips]                               | [✅][028-java] |              | [✅][028-kotlin] |
 | [035][035-question] | [Search Insert Position][035-tips]                           | [✅][035-java] |              | [✅][035-kotlin] |
-| [038][038-question] | [Count and Say][038-tips]                                    | [✅][038-java] |              |                  |
+| [038][038-question] | [Count and Say][038-tips]                                    | [✅][038-java] |              | [✅][038-kotlin] |
 | [053][053-question] | [Maximum Subarray][053-tips]                                 | [✅][053-java] |              |                  |
 | [058][058-question] | [Length of Last Word][058-tips]                              | [✅][058-java] |              |                  |
 | [066][066-question] | [Plus One][066-tips]                                         | [✅][066-java] |              |                  |
@@ -472,4 +472,5 @@
 [027-kotlin]: ./src/_027/kotlin/Solution.kt
 [028-kotlin]: ./src/_028/kotlin/Solution.kt
 [035-kotlin]: ./src/_035/kotlin/Solution.kt
+[038-kotlin]: ./src/_038/kotlin/Solution.kt
 [771-kotlin]: ./src/_771/kotlin/Solution.kt

src/_038/kotlin/Solution.kt

@@ -0,0 +1,38 @@
+package _038.kotlin
+
+/**
+ * @author relish
+ * @since 2018/04/16
+ */
+class Solution {
+    fun countAndSay(n: Int): String {
+        var say = "1"
+        for (count in 1 until n) {
+            say = say(say)
+        }
+        return say
+    }
+
+    private fun say(say: String): String {
+        val newSay = StringBuilder()
+        var prev = say[0]
+        var tCount = 0
+        for (i in say.indices) {
+            if (say[i] == prev) {
+                tCount++
+                continue
+            }
+            newSay.append(tCount).append(prev)
+            prev = say[i]
+            tCount = 1
+        }
+        newSay.append(tCount).append(prev)
+        return newSay.toString()
+    }
+}
+
+fun main(args: Array<String>) {
+    for (i in 1 until 10) {
+        println(Solution().countAndSay(i))
+    }
+}

tips/038/README.md

@@ -43,6 +43,7 @@ Output: "1211"
 
 题意是数和说，根据如下序列 `1, 11, 21, 1211, 111221, ...`，求第 n 个数，规则很简单,就是数和说，数就是数这个数数字有几个，说就是说这个数，所以 `1` 就是 1 个 1：`11`,`11` 就是有 2 个 1：`21`，`21` 就是 1 个 2、1 个 1：`1211`，可想而知后面就是 `111221`，思路的话就是按这个逻辑模拟出来即可。
 
+Java:
 ```java
 class Solution {
     public String countAndSay(int n) {
@@ -67,6 +68,37 @@ class Solution {
 }
 ```
 
+kotlin(172ms/100.00%):
+```kotlin
+class Solution {
+    fun countAndSay(n: Int): String {
+        var say = "1"
+        for (count in 1 until n) {
+            say = say(say)
+        }
+        return say
+    }
+
+    private fun say(say: String): String {
+        val newSay = StringBuilder()
+        var prev = say[0]
+        var tCount = 0
+        for (i in say.indices) {
+            if (say[i] == prev) {
+                tCount++
+                continue
+            }
+            newSay.append(tCount).append(prev)
+            prev = say[i]
+            tCount = 1
+        }
+        newSay.append(tCount).append(prev)
+        return newSay.toString()
+    }
+}
+
+```
+
 
 ## 结语