【LeetCode】【Kotlin】704. Binary Search

class Solution {
    fun search(nums: IntArray, target: Int): Int {
        var min = 0
        var max = nums.size - 1
        var i = nums.size / 2

        while (min <= max){
            if (nums[i] > target){
                max = i - 1
            } else if (nums[i] < target){
                min = i + 1
            } else {
                return i
            }
            i = (min + max) / 2
        }

        return -1
    }
}