[leetcode/kotlin] 35.Search Insert Position

class Solution {
    fun searchInsert(nums: IntArray, target: Int): Int {
        var low = 0
        var high = nums.size - 1
        while (low <= high) {
            var mid = (low + high) / 2 
            if (nums[mid] == target) {
                return mid
            } 
            if (target < nums[mid]) {
                high = mid - 1
            } else {
                low = mid + 1
            }
        }
        
        return low
    }
}