class Solution {
public int search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while(left < right){
int mid = (left + right) >>> 1;
if(nums[mid] == target) return mid;
if(nums[left
二分查找--单调性
最新推荐文章于 2024-05-31 13:35:03 发布