Create 0034-find-first-and-last-position-of-element-in-sorted-array.kt

Author: a93a

kotlin/0034-find-first-and-last-position-of-element-in-sorted-array.kt

@@ -0,0 +1,69 @@
+//same solution but with function
+class Solution {
+    fun searchRange(nums: IntArray, target: Int): IntArray {
+        val res = intArrayOf(-1,-1)
+        
+        fun binarySearch(getLeft: Boolean): Int{
+            var left = 0
+            var right = nums.size-1
+            var pos = -1
+            while(left <= right){
+                val mid = (left + right) / 2
+                if(target > nums[mid]){
+                    left = mid + 1
+                }else if(target < nums[mid]){
+                    right = mid - 1
+                }else{
+                    pos = mid
+                    if(getLeft)
+                        right = mid -1
+                    else
+                        left = mid + 1
+                }
+            }    
+            return pos
+        }
+        
+        res[0] = binarySearch(true)
+        res[1] = binarySearch(false)
+        
+        return res
+    }
+}
+
+class Solution {
+    fun searchRange(nums: IntArray, target: Int): IntArray {
+        val res = intArrayOf(-1,-1)
+        var left = 0
+        var right = nums.size-1
+        var pos = -1
+        var mid = -1
+        while(left <= right){
+            mid = (left + right) / 2
+            if(target > nums[mid]){
+                left = mid + 1
+            }else if(target < nums[mid]){
+                right = mid - 1
+            }else{
+                pos = mid
+                right = mid -1
+            }
+            res[0] = pos
+        }    
+        left = 0
+        right = nums.size-1
+        while(left <= right){
+            mid = (left + right) / 2
+            if(target > nums[mid]){
+                left = mid + 1
+            }else if(target < nums[mid]){
+                right = mid - 1
+            }else{
+                pos = mid
+                left = mid + 1
+            }
+            res[1] = pos
+        }    
+        return res
+    }
+}