1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18

class Solution {
    fun search(nums: IntArray, target: Int): Int {
        var left = 0;
        var right = nums.size - 1;

        while(left <= right){
            val mid = left + (right-left) / 2
            val v = nums[mid]

            when {
                v == target -> return mid
                v < target -> left = mid + 1 
                else -> right = mid - 1        
            }
        }
        return -1
    }
}