Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1. Input: nums = [-1,0,3,5,9,12], target = 9 Output: 4 Explanation: 9 exists in nums and its index is 4 Binary Search의 기본 조건 : 오름차순 정렬 A1. indexOf 이용 (248 ms, 39.5MB) class Solution { fun search(nums: Int..