package array;
/**
* 给定一个已ç»å‡åºæŽ’åºçš„æ•´å½¢æ•°ç»„ï¼Œæ‰¾å‡ºç»™å®šç›®æ ‡å€¼çš„å¼€å§‹ä½ç½®å’Œç»“æŸä½ç½®ã€‚
ä½ çš„ç®—æ³•æ—¶é—´å¤æ‚度必须是 O(log n) 级别。
如果在数组ä¸æ‰¾ä¸åˆ°ç›®æ ‡ï¼Œè¿”回 [-1, -1]。
例如:
给出 [5, 7, 7, 8, 8, 10] å’Œç›®æ ‡å€¼ 8，
返回 [3, 4]。
* Created by Administrator on 2018/3/30 0030.
*/
public class searchRange {
public int[] searchRange(int[] nums, int target) {
int[] result=new int[2];
int size=nums.length;
int low=0;int height=size-1;
int middle=(height-low)/2;
int resultLow=-1;
int resultHigh=-1;
boolean flag=false;
while(low<=height){
if(nums[middle]==target) {
flag=true;
break;
}
else if(nums[middle]>target){
height=middle-1;
}
else low=middle+1;
middle=(height+low)/2;
}
if(flag==true){
resultLow=middle;
resultHigh=middle;
int i=middle;
int j=middle;
while (i>=1&&nums[--i]==nums[middle]){
resultLow=i;
}
while (j