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, return its index. Otherwise, return -1.
You must write an algorithm with O(log n) runtime complexity.
1 <= nums.length <= 10^4-10^4 < nums[i], target < 10^4nums are uniquenums is sorted in ascending ordernums = [-1,0,3,5,9,12], target = 94nums = [-1,0,3,5,9,12], target = 2-1