classSolution{publicintsearch(int[] nums,int target){//区间左闭右闭int left =0, right = nums.length -1;int middle;while(left <= right){
middle =(left + right)/2;if(nums[middle]> target){
right = middle -1;}elseif(nums[middle]< target){
left = middle +1;}else{return middle;}}return-1;}}
class Solution {
public intsearch(int[] nums,int target){// 区间左闭右开int left =0, right = nums.length;int middle;while(left < right){
middle =(left + right)/2;if(nums[middle]> target){
right = middle;}elseif(nums[middle]< target){
left = middle +1;}else{return middle;}}return-1;}}