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

Author: Zuoqiu-Yingyi

solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README.md

@@ -289,6 +289,32 @@ class Solution {
 }
 ```
 
+#### Kotlin
+
+```kotlin
+class Solution {
+    fun searchRange(nums: IntArray, target: Int): IntArray {
+        val left = this.search(nums, target)
+        val right = this.search(nums, target + 1)
+        return if (left == right) intArrayOf(-1, -1) else intArrayOf(left, right - 1)
+    }
+
+    private fun search(nums: IntArray, target: Int): Int {
+        var left = 0
+        var right = nums.size
+        while (left < right) {
+            val middle = (left + right) / 2
+            if (nums[middle] < target) {
+                left = middle + 1
+            } else {
+                right = middle
+            }
+        }
+        return left
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README_EN.md

@@ -279,6 +279,32 @@ class Solution {
 }
 ```
 
+#### Kotlin
+
+```kotlin
+class Solution {
+    fun searchRange(nums: IntArray, target: Int): IntArray {
+        val left = this.search(nums, target)
+        val right = this.search(nums, target + 1)
+        return if (left == right) intArrayOf(-1, -1) else intArrayOf(left, right - 1)
+    }
+
+    private fun search(nums: IntArray, target: Int): Int {
+        var left = 0
+        var right = nums.size
+        while (left < right) {
+            val middle = (left + right) / 2
+            if (nums[middle] < target) {
+                left = middle + 1
+            } else {
+                right = middle
+            }
+        }
+        return left
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/Solution.kt

@@ -0,0 +1,21 @@
+class Solution {
+    fun searchRange(nums: IntArray, target: Int): IntArray {
+        val left = this.search(nums, target)
+        val right = this.search(nums, target + 1)
+        return if (left == right) intArrayOf(-1, -1) else intArrayOf(left, right - 1)
+    }
+
+    private fun search(nums: IntArray, target: Int): Int {
+        var left = 0
+        var right = nums.size
+        while (left < right) {
+            val middle = (left + right) / 2
+            if (nums[middle] < target) {
+                left = middle + 1
+            } else {
+                right = middle
+            }
+        }
+        return left
+    }
+}