LeetCode 704. 二分查找
1. 题目
2. 代码
class Solution {
public int search(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){
return mid;
}else if(nums[mid] < target){
left = mid +1;
}else{
right = mid -1;
}
}
return -1;
}
}