Given a sorted (in ascending order) integer array nums of n elements and a target value, write a function to search target in nums. If target exists, then return its index, otherwise return -1.
Example 1:
Input:nums= [-1,0,3,5,9,12],target= 9 Output: 4 Explanation: 9 exists innumsand its index is 4
Example 2:
Input:nums= [-1,0,3,5,9,12],target= 2 Output: -1 Explanation: 2 does not exist innumsso return -1
Note:
<li>You may assume that all elements in <code>nums</code> are unique.</li>
<li><code>n</code> will be in the range <code>[1, 10000]</code>.</li>
<li>The value of each element in <code>nums</code> will be in the range <code>[-9999, 9999]</code>.</li>