You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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 in nums and its index is 4
*/
class Solution {
public int search(int[] nums, int target) {
int leftIdx = 0;
int rightIdx = nums.length - 1;
while (leftIdx <= rightIdx) {
int middleIdx = leftIdx + (rightIdx - leftIdx) / 2;