feat: add kotlin solution to lc problem: No.0001

Author: Zuoqiu-Yingyi

solution/0000-0099/0001.Two Sum/README.md

@@ -319,6 +319,25 @@ proc twoSum(nums: seq[int], target: int): seq[int] =
                 return @[idx, tdx]
 ```
 
+#### Kotlin
+
+```kotlin
+class Solution {
+    fun twoSum(nums: IntArray, target: Int): IntArray {
+        val m = mutableMapOf<Int, Int>()
+        nums.forEachIndexed { i, x ->
+            val y = target - x
+            val j = m.get(y)
+            if (j != null) {
+                return intArrayOf(j, i)
+            }
+            m[x] = i
+        }
+        return intArrayOf()
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0001.Two Sum/README_EN.md

@@ -316,6 +316,25 @@ proc twoSum(nums: seq[int], target: int): seq[int] =
                 return @[idx, tdx]
 ```
 
+#### Kotlin
+
+```kotlin
+class Solution {
+    fun twoSum(nums: IntArray, target: Int): IntArray {
+        val m = mutableMapOf<Int, Int>()
+        nums.forEachIndexed { i, x ->
+            val y = target - x
+            val j = m.get(y)
+            if (j != null) {
+                return intArrayOf(j, i)
+            }
+            m[x] = i
+        }
+        return intArrayOf()
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0001.Two Sum/Solution.kt

@@ -0,0 +1,14 @@
+class Solution {
+    fun twoSum(nums: IntArray, target: Int): IntArray {
+        val m = mutableMapOf<Int, Int>()
+        nums.forEachIndexed { i, x ->
+            val y = target - x
+            val j = m.get(y)
+            if (j != null) {
+                return intArrayOf(j, i)
+            }
+            m[x] = i
+        }
+        return intArrayOf()
+    }
+}