public static int search1(int[] nums, int target) {
int left = 0 ;
int right = nums.length -1;
while (left <= right){
int mid = left + (right - left) / 2;
if (nums[mid] < target){
left = mid + 1;
}
else if (nums[mid] > target){
right = mid - 1;
}
else return mid;
}
return -1;
}
977.有序数组的平方
最新推荐文章于 2024-11-04 19:24:37 发布