public static int search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while(left <= right) {
int mid = (left + right) >>> 1;
if(nums[mid] < target) {
left = mid + 1;
}else if(nums[mid] > target) {
right = mid - 1;
}else {
return mid;
}
}
return -1;
}
```java
```java
public static int searchOne(int[] nums, int target) {
int start = 0;
int end = nums.length-1;
int mid = 0;
while (start <= end) {
mid = start + (end - start) / 2;
if (nums[mid] < target) {
start = mid + 1;
} else if (nums[mid] > target) {
end = mid - 1;
} else if (nums[mid] == target) {
return mid;
}
}
return -1;
}
二分查找 java
最新推荐文章于 2024-10-05 12:07:50 发布