Daily LeetCode Challenge - 704. Binary Search

Problem From.
https://leetcode.com/problems/binary-search/

오늘 문제는 매우 간단하게 이진탐색(Binary Search) 를 구현하는 문제였다.

class Solution {
    fun search(nums: IntArray, target: Int): Int {
        
        var answer = 0
        var start = 0
        var end = nums.size - 1
        
        while(end >= start) {
            var mid = start + (end - start) / 2
            when {
                nums[mid] == target -> return mid
                nums[mid] < target -> start = mid + 1
                nums[mid] > target -> end = mid - 1
            }
        }
        
        return -1
    }
}