题解 | #二分查找-II#
二分查找-II
http://www.nowcoder.com/practice/4f470d1d3b734f8aaf2afb014185b395
public int search (int[] nums, int target) {
// write code here
if (nums.length == 0) {
return -1;
}
int l = 0;
int r = nums.length;
int mid = 0;
while (l <= r) {
mid = (l + r) / 2;
if (nums[mid] < target) {
l = mid + 1;
} else if (nums[mid] > target){
r = mid - 1;
} else {
while (mid > 0 && nums[mid] == nums[mid - 1]) {
mid--;
}
return mid;
}
}
return -1;
}
宇通开奖5人在聊
投递莉莉丝游戏等公司10个岗位