class Solution {
public int search(int[] nums, int target) {
int right=nums.length-1;
int left=0;
int mid=0;
while(left<=right){
mid=(right+left)/2;
if(target>nums[mid]) {left=mid+1;}
else if(target<nums[mid]) {right=mid-1;}
else return mid;
}
return -1;
}
}
我的算法之路3-二分查找(leetcode704. 二分查找)
最新推荐文章于 2019-11-14 18:50:25 发布