704. Binary Search

1. 직관적인 풀이
   이분탐색 그자체여서 복잡할게 없었다. Binary Search 101!

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        start = 0
        end = len(nums) -1
        mid = 0
        while start <= end:
            mid = (start + end) //2

            if nums[mid] == target:
                return mid
            elif nums[mid] < target:
                start = mid + 1
            else:
                end = mid - 1
                

        return -1