题目:Search for a Range
难度:medium
问题描述:
Given a sorted array of integers, find the starting and ending position of a given target value.
Your algorithm's runtime complexity must be in the order of O(log n).
If the target is not found in the array, return [-1, -1]
.
For example,
Given [5, 7, 7, 8, 8, 10]
and target value 8,
return [3, 4]
.
解题思路:
简单一点的方法从0到nums.length遍历寻找即可。
或者先用二分搜索找到一个target,然后向两边找到边界,这个方法比上一方法快一些。
不过这两个方法提交后都显示只打败了3%和2.5%的java提交者,真是辣鸡呀~
具体代码如下:
public class m_34_SearchForARange {
int mid;
public int[] searchRange(int[] nums, int target) {
int[] res={-1,-1};
if(nums==null) return res;
int p=fenzhi(nums,0,nums.length-1,target);
if(p==-1){
return res;
}
int i=p;
System.out.println("p="+i);
while((i-1)>=0&&nums[i-1]==target){
i--;
}
res[0]=i;
i=p;
while((i+1)
nums[mid]){
return fenzhi(nums,mid,max,target);
}
else{
return mid;
}
}
public int[] searchRange2(int[] nums, int target) {
int[] res={-1,-1};
if(nums==null) return res;
int len=nums.length;
int i;
boolean flag=false;
for(i=0;i