题解 | #二分查找-II#
二分查找-II
http://www.nowcoder.com/practice/4f470d1d3b734f8aaf2afb014185b395
import java.util.*;
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
* 如果目标值存在返回下标,否则返回 -1
* @param nums int整型一维数组
* @param target int整型
* @return int整型
*/
public int search (int[] nums, int target) {
int l =0;
int r=nums.length-1;
while(l<=r){
int mid = (l+r)/2;
if(nums[mid]== target){
while(mid!=0&&(nums[mid-1] ==nums [mid]))
mid--;
return mid;
}else if(nums[mid]> target)
r= r-1;
else
l=l+1;
}
return-1;
}
}