classSolution{publicintsearch(int[] nums,int target){// 左闭右毕版本int l =0, r = nums.length -1;while(l <= r){int mid = l + r >>1;if(nums[mid]> target) r = mid -1;elseif(nums[mid]< target) l = mid +1;elsereturn mid;}return-1;}}
classSolution{publicintsearch(int[] nums,int target){// 左闭右开版本int l =0, r = nums.length;while(l < r){int mid = l + r >>1;if(nums[mid]> target) r = mid;elseif(nums[mid]< target) l = mid +1;elsereturn mid;}return-1;}}
classSolution{publicintsearchInsert(int[] nums,int target){int l =0, r = nums.length;while(l < r){int mid = l + r >>1;if(nums[mid]< target) l = mid +1;elseif(nums[mid]> target) r = mid;elsereturn mid;}return l;}}