704. 二分查找
class Solution {
public int search(int[] nums, int target) {
//设置左右指针
int left = 0;
int right = nums.length - 1;
//遍历数组
while(left <= right){
//获取中间位置
int mid = (left + right) >> 1;
if(nums[mid] == target){
return mid;
}else if(nums[mid] < target){
left = mid + 1