文章摘要
public static int search(int [] nums,int target){int left0;int rightnums.length-1;while (left<right){int mid(leftright)/2;if(nums[mid]target){return mid;}else if(nums[mid]>target){rightmid-1;}else if(nums[mid]<target){leftmid1;}}return -1; }算法逻…